./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN --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 edf451b08ccf28b9358a6fa7c10128ea1b9a8f09b01361f9cd588dc4a31f271a --- 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-6b4ec56 [2022-11-20 11:25:21,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:25:21,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:25:21,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:25:21,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:25:21,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:25:21,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:25:21,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:25:21,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:25:21,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:25:21,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:25:21,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:25:21,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:25:21,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:25:21,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:25:21,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:25:21,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:25:21,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:25:21,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:25:21,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:25:21,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:25:21,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:25:21,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:25:21,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:25:21,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:25:21,188 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:25:21,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:25:21,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:25:21,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:25:21,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:25:21,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:25:21,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:25:21,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:25:21,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:25:21,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:25:21,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:25:21,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:25:21,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:25:21,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:25:21,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:25:21,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:25:21,218 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:25:21,272 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:25:21,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:25:21,273 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:25:21,273 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:25:21,274 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:25:21,274 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:25:21,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:25:21,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:25:21,275 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:25:21,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:25:21,275 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:25:21,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:25:21,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:25:21,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:25:21,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:25:21,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:25:21,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:25:21,277 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:25:21,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:25:21,277 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:25:21,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:25:21,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:25:21,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:25:21,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:25:21,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:25:21,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:25:21,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:25:21,278 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:25:21,279 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:25:21,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:25:21,279 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:25:21,279 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:25:21,279 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:25:21,279 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_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/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_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN 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 -> edf451b08ccf28b9358a6fa7c10128ea1b9a8f09b01361f9cd588dc4a31f271a [2022-11-20 11:25:21,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:25:21,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:25:21,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:25:21,590 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:25:21,591 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:25:21,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i [2022-11-20 11:25:24,625 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:25:24,813 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:25:24,814 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i [2022-11-20 11:25:24,821 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/data/b7f295194/33755f5355d746fe851049d3c6492a7a/FLAG90edca1ea [2022-11-20 11:25:24,835 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/data/b7f295194/33755f5355d746fe851049d3c6492a7a [2022-11-20 11:25:24,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:25:24,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:25:24,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:25:24,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:25:24,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:25:24,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:25:24" (1/1) ... [2022-11-20 11:25:24,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c62e721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:24, skipping insertion in model container [2022-11-20 11:25:24,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:25:24" (1/1) ... [2022-11-20 11:25:24,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:25:24,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:25:25,052 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[1226,1239] [2022-11-20 11:25:25,104 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[2841,2854] [2022-11-20 11:25:25,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:25:25,119 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:25:25,149 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[1226,1239] [2022-11-20 11:25:25,173 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[2841,2854] [2022-11-20 11:25:25,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:25:25,195 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:25:25,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:25 WrapperNode [2022-11-20 11:25:25,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:25:25,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:25:25,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:25:25,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:25:25,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:25" (1/1) ... [2022-11-20 11:25:25,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:25" (1/1) ... [2022-11-20 11:25:25,270 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2022-11-20 11:25:25,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:25:25,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:25:25,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:25:25,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:25:25,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:25" (1/1) ... [2022-11-20 11:25:25,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:25" (1/1) ... [2022-11-20 11:25:25,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:25" (1/1) ... [2022-11-20 11:25:25,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:25" (1/1) ... [2022-11-20 11:25:25,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:25" (1/1) ... [2022-11-20 11:25:25,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:25" (1/1) ... [2022-11-20 11:25:25,312 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:25" (1/1) ... [2022-11-20 11:25:25,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:25" (1/1) ... [2022-11-20 11:25:25,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:25:25,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:25:25,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:25:25,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:25:25,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:25" (1/1) ... [2022-11-20 11:25:25,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:25:25,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:25:25,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:25:25,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:25:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:25:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-20 11:25:25,407 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-20 11:25:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-20 11:25:25,407 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-20 11:25:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:25:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:25:25,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:25:25,483 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:25:25,486 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:25:25,777 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:25:25,783 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:25:25,784 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 11:25:25,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:25:25 BoogieIcfgContainer [2022-11-20 11:25:25,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:25:25,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:25:25,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:25:25,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:25:25,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:25:24" (1/3) ... [2022-11-20 11:25:25,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2aa13d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:25:25, skipping insertion in model container [2022-11-20 11:25:25,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:25" (2/3) ... [2022-11-20 11:25:25,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2aa13d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:25:25, skipping insertion in model container [2022-11-20 11:25:25,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:25:25" (3/3) ... [2022-11-20 11:25:25,812 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_2.i [2022-11-20 11:25:25,834 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:25:25,839 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 11:25:25,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:25:25,915 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;@72f16722, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:25:25,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-20 11:25:25,920 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-20 11:25:25,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:25:25,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:25,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:25,931 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:25:25,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:25,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-20 11:25:25,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:25,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095015970] [2022-11-20 11:25:25,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:25,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:26,215 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-20 11:25:26,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:26,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095015970] [2022-11-20 11:25:26,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095015970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:26,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:26,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:25:26,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931091371] [2022-11-20 11:25:26,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:26,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:26,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:26,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:26,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:26,255 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-20 11:25:26,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:26,338 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2022-11-20 11:25:26,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:25:26,341 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-20 11:25:26,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:26,349 INFO L225 Difference]: With dead ends: 90 [2022-11-20 11:25:26,349 INFO L226 Difference]: Without dead ends: 36 [2022-11-20 11:25:26,352 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-20 11:25:26,355 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 30 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:26,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 107 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:25:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-20 11:25:26,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-11-20 11:25:26,387 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-20 11:25:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-11-20 11:25:26,390 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2022-11-20 11:25:26,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:26,391 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-11-20 11:25:26,391 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-20 11:25:26,391 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-11-20 11:25:26,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:25:26,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:26,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:26,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:25:26,394 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:25:26,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:26,395 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-11-20 11:25:26,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:26,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428884066] [2022-11-20 11:25:26,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:26,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:26,493 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-20 11:25:26,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:26,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428884066] [2022-11-20 11:25:26,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428884066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:26,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:26,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:25:26,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602672673] [2022-11-20 11:25:26,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:26,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:26,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:26,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:26,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:26,498 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-20 11:25:26,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:26,527 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-20 11:25:26,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:25:26,528 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-20 11:25:26,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:26,529 INFO L225 Difference]: With dead ends: 36 [2022-11-20 11:25:26,530 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 11:25:26,530 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-20 11:25:26,532 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-20 11:25:26,532 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-20 11:25:26,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 11:25:26,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-20 11:25:26,538 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-20 11:25:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-20 11:25:26,540 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-11-20 11:25:26,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:26,540 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-20 11:25:26,541 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-20 11:25:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-20 11:25:26,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:25:26,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:26,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:26,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:25:26,543 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:25:26,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2022-11-20 11:25:26,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:26,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73292107] [2022-11-20 11:25:26,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:26,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:26,575 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:25:26,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845165633] [2022-11-20 11:25:26,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:26,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:26,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:25:26,585 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:25:26,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:25:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:26,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 11:25:26,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:26,777 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-20 11:25:26,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:25:26,867 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-20 11:25:26,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:26,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73292107] [2022-11-20 11:25:26,868 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:25:26,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845165633] [2022-11-20 11:25:26,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845165633] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:25:26,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:25:26,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-11-20 11:25:26,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270177845] [2022-11-20 11:25:26,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:25:26,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:25:26,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:26,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:25:26,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:25:26,871 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-20 11:25:27,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:27,015 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-11-20 11:25:27,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:25:27,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-20 11:25:27,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:27,017 INFO L225 Difference]: With dead ends: 37 [2022-11-20 11:25:27,017 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 11:25:27,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:25:27,020 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:27,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 179 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 11:25:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-20 11:25:27,026 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-20 11:25:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-11-20 11:25:27,027 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2022-11-20 11:25:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:27,028 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-11-20 11:25:27,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-20 11:25:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-11-20 11:25:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 11:25:27,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:27,030 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:27,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 11:25:27,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:27,236 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:25:27,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:27,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1659957129, now seen corresponding path program 2 times [2022-11-20 11:25:27,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:27,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894897197] [2022-11-20 11:25:27,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:27,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:27,249 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:25:27,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1831622486] [2022-11-20 11:25:27,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:25:27,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:27,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:25:27,259 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:25:27,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:25:27,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:25:27,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:25:27,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 11:25:27,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:39,377 WARN L233 SmtUtils]: Spent 10.92s on a formula simplification. DAG size of input: 72 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:25:40,575 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-20 11:25:40,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:28:06,347 WARN L233 SmtUtils]: Spent 2.21m on a formula simplification. DAG size of input: 129 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:28:09,604 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-20 11:28:09,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:28:09,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894897197] [2022-11-20 11:28:09,604 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:28:09,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831622486] [2022-11-20 11:28:09,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831622486] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:28:09,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:28:09,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-11-20 11:28:09,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793520159] [2022-11-20 11:28:09,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:28:09,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 11:28:09,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:28:09,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 11:28:09,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=195, Unknown=1, NotChecked=0, Total=240 [2022-11-20 11:28:09,608 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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-20 11:28:15,282 WARN L233 SmtUtils]: Spent 5.44s on a formula simplification. DAG size of input: 48 DAG size of output: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:28:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:28:15,299 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-11-20 11:28:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:28:15,300 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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-20 11:28:15,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:28:15,301 INFO L225 Difference]: With dead ends: 38 [2022-11-20 11:28:15,301 INFO L226 Difference]: Without dead ends: 32 [2022-11-20 11:28:15,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 155.8s TimeCoverageRelationStatistics Valid=51, Invalid=220, Unknown=1, NotChecked=0, Total=272 [2022-11-20 11:28:15,303 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:28:15,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 258 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-11-20 11:28:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-20 11:28:15,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-20 11:28:15,308 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-20 11:28:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-20 11:28:15,309 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 13 [2022-11-20 11:28:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:28:15,310 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-20 11:28:15,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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-20 11:28:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-20 11:28:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:28:15,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:28:15,311 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:28:15,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:28:15,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:28:15,512 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:28:15,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:28:15,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1682229690, now seen corresponding path program 3 times [2022-11-20 11:28:15,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:28:15,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325439806] [2022-11-20 11:28:15,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:28:15,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:28:15,533 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:28:15,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2047532389] [2022-11-20 11:28:15,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:28:15,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:28:15,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:28:15,535 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:28:15,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:28:15,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 11:28:15,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:28:15,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 11:28:15,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:28:32,782 WARN L233 SmtUtils]: Spent 9.07s on a formula simplification. DAG size of input: 55 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:29:12,795 WARN L233 SmtUtils]: Spent 24.12s on a formula simplification that was a NOOP. DAG size: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:29:56,918 WARN L233 SmtUtils]: Spent 36.01s on a formula simplification. DAG size of input: 82 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:30:20,368 WARN L233 SmtUtils]: Spent 17.85s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:30:45,891 WARN L233 SmtUtils]: Spent 16.08s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:30:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:30:49,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:32:04,146 WARN L233 SmtUtils]: Spent 44.54s on a formula simplification. DAG size of input: 88 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:33:34,637 WARN L859 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse7 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse26 (not .cse7)) (.cse2 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse1 256))) (let ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse0) 256))) (or (= .cse0 0) (<= (mod (+ .cse1 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse3) 256) 0)) (not (<= .cse0 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse0) (<= .cse3 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse6 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod (+ .cse6 .cse2) 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse5)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse5 127) (not (<= (mod .cse6 256) 127)) (<= (mod (+ .cse6 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse4) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse5) (= .cse6 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse7) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod .cse10 256))) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse9)) 256))) (or (<= .cse8 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse9) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse8) 256) 0)) (<= (mod (+ .cse10 .cse2) 256) 127) (<= .cse9 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| 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 .cse2) 256))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse12)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse11 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse12 127) (<= (mod .cse13 256) 127) (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse11) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse12)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse14 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse14 .cse2) 256))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse16)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse15 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse16 127) (not (<= (mod .cse14 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse15) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse16) (= .cse14 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod .cse18 256))) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse17) 256))) (or (= .cse17 0) (not (<= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse18 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse19) 256) 0)) (not (<= .cse17 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse17) (<= .cse19 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse7) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|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))) (let ((.cse22 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse21) 256))) (or (not (<= (mod (+ .cse20 .cse2) 256) 127)) (= .cse21 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse22) 256) 0)) (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_20| .cse21) (<= .cse22 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse23 (mod (+ .cse25 .cse2) 256))) (let ((.cse24 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse23) 256))) (or (not (<= .cse23 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse24) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse23) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse23 0) (<= .cse24 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse25 256) 127)) (<= (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse25 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse7) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod .cse29 256))) (let ((.cse27 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse28)) 256))) (or (<= .cse27 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse28) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse27) 256) 0)) (not (<= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse29 .cse2) 256) 127) (<= .cse28 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse30) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse30 127)) (<= (mod (+ .cse31 .cse2) 256) 127) (<= (mod .cse31 256) 127) (= 0 .cse30) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse30) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse32) 256) 0)) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod (+ .cse35 .cse2) 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse33) 256))) (or (not (<= .cse33 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse34) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse33) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse33 0) (<= .cse34 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse35 256) 127) (<= (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse37 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod .cse37 256))) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse38)) 256))) (or (<= .cse36 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse37 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse38) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse36) 256) 0)) (<= .cse38 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse37 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse7) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse40 (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse41 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse40) 256))) (or (not (<= (mod (+ .cse39 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse40 127)) (= 0 .cse40) (not (<= (mod .cse39 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse40) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse41) 256) 0)) (<= .cse41 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod .cse42 256))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse43) 256))) (or (not (<= (mod (+ .cse42 .cse2) 256) 127)) (= .cse43 0) (not (<= (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse44) 256) 0)) (not (<= .cse43 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse43) (<= .cse44 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod .cse45 256))) (let ((.cse47 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse46) 256))) (or (not (<= (mod (+ .cse45 .cse2) 256) 127)) (= .cse46 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse47) 256) 0)) (not (<= .cse46 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse46) (<= .cse47 |c_ULTIMATE.start_main1_~y~0#1|)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse48 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod (+ .cse48 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse50 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse49)) 256))) (or (not (<= (mod (+ .cse48 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod .cse48 256) 127)) (<= .cse49 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse49) (<= .cse50 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse50) 256) 0)) (= .cse48 0)))))))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse52 (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse53 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse52)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse51 .cse2) 256) 127) (not (<= (mod .cse51 256) 127)) (<= .cse52 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse52) (<= .cse53 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse53) 256) 0)) (= .cse51 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse54 (mod .cse55 256))) (let ((.cse56 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse54) 256))) (or (= .cse54 0) (<= (mod (+ .cse55 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse56) 256) 0)) (not (<= .cse54 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse54) (<= .cse56 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse58 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse58 256))) (let ((.cse57 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse59)) 256))) (or (<= .cse57 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse58 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse59) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse57) 256) 0)) (not (<= (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse59 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse60 (mod (+ .cse62 .cse2) 256))) (let ((.cse61 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse60) 256))) (or (not (<= .cse60 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse61) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse60) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse60 0) (<= .cse61 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse62 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse64 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse63 (mod (+ .cse64 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse65 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse63) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse63 127)) (<= (mod (+ .cse64 .cse2) 256) 127) (= 0 .cse63) (not (<= (mod .cse64 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse63) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse65) 256) 0)) (<= .cse65 |c_ULTIMATE.start_main1_~y~0#1|) (= .cse64 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse67 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse66 (mod .cse67 256))) (let ((.cse68 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse66) 256))) (or (= .cse66 0) (not (<= (mod (+ .cse67 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse67 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse68) 256) 0)) (not (<= .cse66 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse66) (<= .cse68 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse69 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse69 .cse2) 256))) (let ((.cse70 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse71)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse69 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse70 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse71 127) (<= (mod .cse69 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse70) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse71)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse74 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse73 (mod .cse74 256))) (let ((.cse72 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse73)) 256))) (or (<= .cse72 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse73) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse72) 256) 0)) (not (<= (mod (+ .cse74 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse74 .cse2) 256) 127) (<= .cse73 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse76 (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse77 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse76)) 256))) (or (not (<= (mod (+ .cse75 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse75 256) 127) (<= .cse76 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse76) (<= .cse77 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse77) 256) 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse79 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse80 (mod .cse79 256))) (let ((.cse78 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse80)) 256))) (or (<= .cse78 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse79 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse80) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse78) 256) 0)) (<= .cse80 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse79 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse83 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse82 (mod .cse83 256))) (let ((.cse81 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse82)) 256))) (or (<= .cse81 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse82) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse81) 256) 0)) (<= (mod (+ .cse83 .cse2) 256) 127) (<= .cse82 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse83 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse84 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse85 (mod (+ .cse84 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse86 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse85)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse84 .cse2) 256) 127) (<= (mod .cse84 256) 127) (<= .cse85 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse85) (<= .cse86 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse86) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse89 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse89 .cse2) 256))) (let ((.cse88 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse87) 256))) (or (not (<= .cse87 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse88) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse87) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse89 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse87 0) (<= .cse88 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse89 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse90 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse91 (mod .cse90 256))) (let ((.cse92 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse91) 256))) (or (not (<= (mod (+ .cse90 .cse2) 256) 127)) (= .cse91 0) (not (<= (mod (+ .cse90 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse92) 256) 0)) (not (<= .cse91 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse91) (<= .cse92 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse94 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse95 (mod .cse94 256))) (let ((.cse93 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse95)) 256))) (or (<= .cse93 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse94 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse95) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse93) 256) 0)) (not (<= (mod (+ .cse94 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse95 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse96 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse97 (mod (+ .cse96 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse98 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse97) 256))) (or (not (<= (mod (+ .cse96 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse97 127)) (<= (mod .cse96 256) 127) (= 0 .cse97) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse97) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse98) 256) 0)) (<= .cse98 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0)))))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) is different from true [2022-11-20 11:33:59,394 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse2 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse1 256))) (let ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse0) 256))) (or (= .cse0 0) (<= (mod (+ .cse1 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse3) 256) 0)) (not (<= .cse0 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse0) (<= .cse3 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| 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 ((.cse6 (mod .cse5 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse6)) 256))) (or (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse5 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse6) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse4) 256) 0)) (not (<= (mod (+ .cse5 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse6 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod (+ .cse9 .cse2) 256))) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse7) 256))) (or (not (<= .cse7 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse8) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse7) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse7 0) (<= .cse8 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse9 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod (+ .cse10 .cse2) 256))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse12)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse11 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse12 127) (not (<= (mod .cse10 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse11) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse12) (= .cse10 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| 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 ((.cse14 (mod .cse13 256))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse14) 256))) (or (not (<= (mod (+ .cse13 .cse2) 256) 127)) (= .cse14 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse15) 256) 0)) (not (<= .cse14 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse14) (<= .cse15 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse18 .cse2) 256))) (let ((.cse17 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse16) 256))) (or (not (<= .cse16 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse17) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse16) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse16 0) (<= .cse17 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse18 256) 127)) (<= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse18 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod .cse21 256))) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse20)) 256))) (or (<= .cse19 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse20) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse19) 256) 0)) (<= (mod (+ .cse21 .cse2) 256) 127) (<= .cse20 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse22 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ .cse22 .cse2) 256))) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse24)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse22 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse23 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse24 127) (<= (mod .cse22 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse23) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse24)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse27 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse27 .cse2) 256))) (let ((.cse26 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse25) 256))) (or (not (<= .cse25 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse26) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse25) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse25 0) (<= .cse26 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse27 256) 127) (<= (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|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 256))) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse29) 256))) (or (not (<= (mod (+ .cse28 .cse2) 256) 127)) (= .cse29 0) (not (<= (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse30) 256) 0)) (not (<= .cse29 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse29) (<= .cse30 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| 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 ((.cse31 (mod (+ .cse33 .cse2) 256))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse31) 256))) (or (not (<= .cse31 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse32) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse31) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse31 0) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse33 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse36 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod (+ .cse36 .cse2) 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse35)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse34 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse35 127) (not (<= (mod .cse36 256) 127)) (<= (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse34) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse35) (= .cse36 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod (+ .cse39 .cse2) 256))) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse38)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse37 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse38 127) (<= (mod .cse39 256) 127) (<= (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse37) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse38)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod .cse42 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse41)) 256))) (or (<= .cse40 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse41) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse40) 256) 0)) (not (<= (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse42 .cse2) 256) 127) (<= .cse41 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse45 (mod .cse44 256))) (let ((.cse43 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse45)) 256))) (or (<= .cse43 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse44 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse45) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse43) 256) 0)) (<= .cse45 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod .cse47 256))) (let ((.cse48 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse46) 256))) (or (= .cse46 0) (not (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse47 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse48) 256) 0)) (not (<= .cse46 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse46) (<= .cse48 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (< |c_ULTIMATE.start_gcd_test_~b#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-20 11:34:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 11:34:22,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:34:22,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325439806] [2022-11-20 11:34:22,903 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:34:22,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047532389] [2022-11-20 11:34:22,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047532389] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:34:22,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:34:22,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-11-20 11:34:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424878009] [2022-11-20 11:34:22,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:34:22,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 11:34:22,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:34:22,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 11:34:22,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=245, Unknown=9, NotChecked=66, Total=380 [2022-11-20 11:34:22,906 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-20 11:34:24,965 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (let ((.cse2 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse1 256))) (let ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse0) 256))) (or (= .cse0 0) (<= (mod (+ .cse1 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse3) 256) 0)) (not (<= .cse0 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse0) (<= .cse3 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| 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 ((.cse6 (mod .cse5 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse6)) 256))) (or (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse5 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse6) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse4) 256) 0)) (not (<= (mod (+ .cse5 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse6 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod (+ .cse9 .cse2) 256))) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse7) 256))) (or (not (<= .cse7 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse8) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse7) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse7 0) (<= .cse8 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse9 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod (+ .cse10 .cse2) 256))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse12)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse11 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse12 127) (not (<= (mod .cse10 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse11) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse12) (= .cse10 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| 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 ((.cse14 (mod .cse13 256))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse14) 256))) (or (not (<= (mod (+ .cse13 .cse2) 256) 127)) (= .cse14 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse15) 256) 0)) (not (<= .cse14 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse14) (<= .cse15 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse18 .cse2) 256))) (let ((.cse17 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse16) 256))) (or (not (<= .cse16 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse17) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse16) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse16 0) (<= .cse17 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse18 256) 127)) (<= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse18 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod .cse21 256))) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse20)) 256))) (or (<= .cse19 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse20) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse19) 256) 0)) (<= (mod (+ .cse21 .cse2) 256) 127) (<= .cse20 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse22 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ .cse22 .cse2) 256))) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse24)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse22 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse23 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse24 127) (<= (mod .cse22 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse23) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse24)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse27 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse27 .cse2) 256))) (let ((.cse26 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse25) 256))) (or (not (<= .cse25 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse26) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse25) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse25 0) (<= .cse26 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse27 256) 127) (<= (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|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 256))) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse29) 256))) (or (not (<= (mod (+ .cse28 .cse2) 256) 127)) (= .cse29 0) (not (<= (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse30) 256) 0)) (not (<= .cse29 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse29) (<= .cse30 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| 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 ((.cse31 (mod (+ .cse33 .cse2) 256))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse31) 256))) (or (not (<= .cse31 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse32) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse31) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse31 0) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse33 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse36 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod (+ .cse36 .cse2) 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse35)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse34 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse35 127) (not (<= (mod .cse36 256) 127)) (<= (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse34) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse35) (= .cse36 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod (+ .cse39 .cse2) 256))) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse38)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse37 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse38 127) (<= (mod .cse39 256) 127) (<= (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse37) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse38)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod .cse42 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse41)) 256))) (or (<= .cse40 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse41) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse40) 256) 0)) (not (<= (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse42 .cse2) 256) 127) (<= .cse41 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse45 (mod .cse44 256))) (let ((.cse43 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse45)) 256))) (or (<= .cse43 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse44 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse45) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse43) 256) 0)) (<= .cse45 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod .cse47 256))) (let ((.cse48 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse46) 256))) (or (= .cse46 0) (not (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse47 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse48) 256) 0)) (not (<= .cse46 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse46) (<= .cse48 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|)) is different from true [2022-11-20 11:34:27,025 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse0 (not .cse8))) (and .cse0 (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|) (or (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| 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 ((.cse1 (mod .cse2 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse1) 256))) (or (= .cse1 0) (<= (mod (+ .cse2 .cse3) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse4) 256) 0)) (not (<= .cse1 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse2 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse1) (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|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 .cse3) 256))) (let ((.cse5 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse6)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse5 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse6 127) (not (<= (mod .cse7 256) 127)) (<= (mod (+ .cse7 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse5) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse6) (= .cse7 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse8) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| 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 256))) (let ((.cse9 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse10)) 256))) (or (<= .cse9 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse10) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse9) 256) 0)) (<= (mod (+ .cse11 .cse3) 256) 127) (<= .cse10 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse14 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (mod (+ .cse14 .cse3) 256))) (let ((.cse12 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse13)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse12 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse13 127) (<= (mod .cse14 256) 127) (<= (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse12) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse13)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| 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 ((.cse17 (mod (+ .cse15 .cse3) 256))) (let ((.cse16 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse17)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse16 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse17 127) (not (<= (mod .cse15 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse16) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse17) (= .cse15 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| 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))) (let ((.cse20 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse18) 256))) (or (= .cse18 0) (not (<= (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse19 .cse3) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse20) 256) 0)) (not (<= .cse18 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse18) (<= .cse20 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse8) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse21 256))) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse22) 256))) (or (not (<= (mod (+ .cse21 .cse3) 256) 127)) (= .cse22 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse23) 256) 0)) (not (<= .cse22 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse22) (<= .cse23 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse26 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ .cse26 .cse3) 256))) (let ((.cse25 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse24) 256))) (or (not (<= .cse24 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse25) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse24) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse24 0) (<= .cse25 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse26 256) 127)) (<= (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse26 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse8) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod .cse29 256))) (let ((.cse27 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse28)) 256))) (or (<= .cse27 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse28) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse27) 256) 0)) (not (<= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse29 .cse3) 256) 127) (<= .cse28 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse30) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse30 127)) (<= (mod (+ .cse31 .cse3) 256) 127) (<= (mod .cse31 256) 127) (= 0 .cse30) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse30) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse32) 256) 0)) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod (+ .cse35 .cse3) 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse33) 256))) (or (not (<= .cse33 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse34) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse33) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse33 0) (<= .cse34 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse35 256) 127) (<= (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse37 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod .cse37 256))) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse38)) 256))) (or (<= .cse36 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse37 .cse3) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse38) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse36) 256) 0)) (<= .cse38 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse37 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse8) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse40 (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse41 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse40) 256))) (or (not (<= (mod (+ .cse39 .cse3) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse40 127)) (= 0 .cse40) (not (<= (mod .cse39 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse40) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse41) 256) 0)) (<= .cse41 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod .cse42 256))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse43) 256))) (or (not (<= (mod (+ .cse42 .cse3) 256) 127)) (= .cse43 0) (not (<= (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse44) 256) 0)) (not (<= .cse43 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse43) (<= .cse44 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod .cse45 256))) (let ((.cse47 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse46) 256))) (or (not (<= (mod (+ .cse45 .cse3) 256) 127)) (= .cse46 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse47) 256) 0)) (not (<= .cse46 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse46) (<= .cse47 |c_ULTIMATE.start_main1_~y~0#1|)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse48 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod (+ .cse48 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse50 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse49)) 256))) (or (not (<= (mod (+ .cse48 .cse3) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod .cse48 256) 127)) (<= .cse49 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse49) (<= .cse50 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse50) 256) 0)) (= .cse48 0)))))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse52 (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse53 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse52)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse51 .cse3) 256) 127) (not (<= (mod .cse51 256) 127)) (<= .cse52 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse52) (<= .cse53 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse53) 256) 0)) (= .cse51 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse54 (mod .cse55 256))) (let ((.cse56 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse54) 256))) (or (= .cse54 0) (<= (mod (+ .cse55 .cse3) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse56) 256) 0)) (not (<= .cse54 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse54) (<= .cse56 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse58 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse58 256))) (let ((.cse57 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse59)) 256))) (or (<= .cse57 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse58 .cse3) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse59) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse57) 256) 0)) (not (<= (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse59 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse60 (mod (+ .cse62 .cse3) 256))) (let ((.cse61 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse60) 256))) (or (not (<= .cse60 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse61) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse60) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse60 0) (<= .cse61 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse62 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse64 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse63 (mod (+ .cse64 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse65 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse63) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse63 127)) (<= (mod (+ .cse64 .cse3) 256) 127) (= 0 .cse63) (not (<= (mod .cse64 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse63) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse65) 256) 0)) (<= .cse65 |c_ULTIMATE.start_main1_~y~0#1|) (= .cse64 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse67 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse66 (mod .cse67 256))) (let ((.cse68 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse66) 256))) (or (= .cse66 0) (not (<= (mod (+ .cse67 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse67 .cse3) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse68) 256) 0)) (not (<= .cse66 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse66) (<= .cse68 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse69 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse69 .cse3) 256))) (let ((.cse70 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse71)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse69 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse70 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse71 127) (<= (mod .cse69 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse70) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse71)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse74 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse73 (mod .cse74 256))) (let ((.cse72 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse73)) 256))) (or (<= .cse72 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse73) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse72) 256) 0)) (not (<= (mod (+ .cse74 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse74 .cse3) 256) 127) (<= .cse73 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse76 (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse77 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse76)) 256))) (or (not (<= (mod (+ .cse75 .cse3) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse75 256) 127) (<= .cse76 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse76) (<= .cse77 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse77) 256) 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse79 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse80 (mod .cse79 256))) (let ((.cse78 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse80)) 256))) (or (<= .cse78 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse79 .cse3) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse80) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse78) 256) 0)) (<= .cse80 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse79 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse83 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse82 (mod .cse83 256))) (let ((.cse81 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse82)) 256))) (or (<= .cse81 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse82) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse81) 256) 0)) (<= (mod (+ .cse83 .cse3) 256) 127) (<= .cse82 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse83 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse84 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse85 (mod (+ .cse84 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse86 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse85)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse84 .cse3) 256) 127) (<= (mod .cse84 256) 127) (<= .cse85 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse85) (<= .cse86 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse86) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse89 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse89 .cse3) 256))) (let ((.cse88 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse87) 256))) (or (not (<= .cse87 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse88) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse87) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse89 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse87 0) (<= .cse88 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse89 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse90 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse91 (mod .cse90 256))) (let ((.cse92 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse91) 256))) (or (not (<= (mod (+ .cse90 .cse3) 256) 127)) (= .cse91 0) (not (<= (mod (+ .cse90 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse92) 256) 0)) (not (<= .cse91 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse91) (<= .cse92 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse94 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse95 (mod .cse94 256))) (let ((.cse93 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse95)) 256))) (or (<= .cse93 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse94 .cse3) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse95) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse93) 256) 0)) (not (<= (mod (+ .cse94 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse95 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse96 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse97 (mod (+ .cse96 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse98 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse97) 256))) (or (not (<= (mod (+ .cse96 .cse3) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse97 127)) (<= (mod .cse96 256) 127) (= 0 .cse97) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse97) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse98) 256) 0)) (<= .cse98 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)))))) is different from true [2022-11-20 11:34:49,118 WARN L233 SmtUtils]: Spent 16.78s on a formula simplification. DAG size of input: 57 DAG size of output: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:34:49,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:34:49,673 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-11-20 11:34:49,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 11:34:49,674 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 14 [2022-11-20 11:34:49,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:34:49,675 INFO L225 Difference]: With dead ends: 49 [2022-11-20 11:34:49,675 INFO L226 Difference]: Without dead ends: 39 [2022-11-20 11:34:49,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 219.2s TimeCoverageRelationStatistics Valid=79, Invalid=304, Unknown=13, NotChecked=156, Total=552 [2022-11-20 11:34:49,677 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:34:49,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 76 Unchecked, 0.0s Time] [2022-11-20 11:34:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-20 11:34:49,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-11-20 11:34:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 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-20 11:34:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-11-20 11:34:49,699 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 14 [2022-11-20 11:34:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:34:49,699 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-11-20 11:34:49,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-20 11:34:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-11-20 11:34:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:34:49,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:34:49,700 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:34:49,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-20 11:34:49,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:34:49,906 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:34:49,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:34:49,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1911673028, now seen corresponding path program 1 times [2022-11-20 11:34:49,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:34:49,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475091319] [2022-11-20 11:34:49,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:34:49,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:34:49,914 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:34:49,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [141653881] [2022-11-20 11:34:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:34:49,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:34:49,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:34:49,916 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:34:49,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:34:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:34:50,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 11:34:50,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:35:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:35:25,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:36:41,264 WARN L233 SmtUtils]: Spent 53.69s on a formula simplification. DAG size of input: 94 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:37:29,539 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse40 (mod (+ .cse26 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse22 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse38 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse20 (mod .cse26 256)) (.cse15 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse42 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse38) 256))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_28| .cse38) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse42) 256) 0)) (< .cse42 .cse22))))) (.cse16 (= .cse38 0)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse14 (<= .cse40 127)) (.cse2 (= .cse40 0)) (.cse3 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse41 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse40) 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse41) 256) 0)) (< .cse41 .cse22) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_28| .cse40))))) (.cse4 (not .cse19)) (.cse0 (<= .cse38 127))) (let ((.cse18 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse39 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse40)) 256))) (or (< .cse39 .cse22) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse39) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_28|) .cse40))))) (.cse12 (not .cse0)) (.cse8 (or .cse2 .cse3 .cse4)) (.cse13 (not .cse14)) (.cse24 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse38)) 256))) (or (< .cse37 .cse22) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse37) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_28|) .cse38) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))) (.cse11 (not .cse6)) (.cse10 (or .cse15 .cse4 .cse16)) (.cse27 (<= .cse20 127))) (and (or (let ((.cse23 (= .cse20 0))) (let ((.cse1 (= .cse26 0)) (.cse9 (or .cse19 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse25 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse20) 256))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_28| .cse20) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse25) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0) (< .cse25 .cse22)))) .cse23))) (let ((.cse7 (or .cse11 (and (or .cse1 .cse24 .cse4) .cse9))) (.cse5 (or .cse19 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse21 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse20) 256))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_28| .cse20) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse21) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (< .cse21 .cse22)))) .cse23))) (and (or (and (or .cse0 (and (or (and (or .cse1 .cse2 .cse3 .cse4) .cse5) .cse6) .cse7)) (or (and (or .cse6 (and .cse5 .cse8)) (or (and .cse9 .cse10) .cse11)) .cse12)) .cse13) (or .cse14 (let ((.cse17 (or (and .cse5 (or .cse1 .cse18 .cse4)) .cse6))) (and (or (and (or .cse11 (and .cse9 (or .cse1 .cse15 .cse4 .cse16))) .cse17) .cse12) (or .cse0 (and .cse7 .cse17))))))))) (not .cse27)) (or (let ((.cse34 (+ (- 256) .cse20))) (let ((.cse35 (or .cse19 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse34) 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse36) 256) 0)) (< .cse36 .cse22) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_28|) .cse20) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))))) (let ((.cse30 (or .cse11 (and .cse35 .cse10))) (.cse28 (or .cse11 (and (or .cse24 .cse4) .cse35))) (.cse31 (or .cse19 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse33 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse34) 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse33) 256) 0)) (< .cse33 .cse22) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_28|) .cse20))))))) (and (or .cse14 (let ((.cse29 (or .cse6 (and (or .cse18 .cse4) .cse31)))) (and (or (and .cse28 .cse29) .cse0) (or .cse12 (and .cse30 .cse29))))) (or (let ((.cse32 (or .cse6 (and .cse8 .cse31)))) (and (or (and .cse30 .cse32) .cse12) (or (and .cse28 .cse32) .cse0))) .cse13))))) .cse27)))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) is different from false [2022-11-20 11:39:56,202 WARN L233 SmtUtils]: Spent 2.14m on a formula simplification. DAG size of input: 111 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:40:20,581 WARN L233 SmtUtils]: Spent 13.61s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:40:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 11:40:20,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:40:20,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475091319] [2022-11-20 11:40:20,669 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:40:20,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141653881] [2022-11-20 11:40:20,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141653881] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:40:20,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:40:20,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-11-20 11:40:20,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514181191] [2022-11-20 11:40:20,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:40:20,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 11:40:20,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:40:20,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 11:40:20,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=336, Unknown=6, NotChecked=38, Total=462 [2022-11-20 11:40:20,672 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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-20 11:40:33,477 WARN L233 SmtUtils]: Spent 9.02s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:40:39,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:40:39,274 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-11-20 11:40:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 11:40:39,275 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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 14 [2022-11-20 11:40:39,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:40:39,276 INFO L225 Difference]: With dead ends: 52 [2022-11-20 11:40:39,276 INFO L226 Difference]: Without dead ends: 42 [2022-11-20 11:40:39,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 260.8s TimeCoverageRelationStatistics Valid=120, Invalid=477, Unknown=7, NotChecked=46, Total=650 [2022-11-20 11:40:39,278 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:40:39,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 337 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 68 Unchecked, 0.3s Time] [2022-11-20 11:40:39,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-20 11:40:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2022-11-20 11:40:39,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 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-20 11:40:39,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-11-20 11:40:39,305 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 14 [2022-11-20 11:40:39,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:40:39,306 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-20 11:40:39,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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-20 11:40:39,306 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-11-20 11:40:39,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 11:40:39,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:40:39,307 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:40:39,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:40:39,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 11:40:39,513 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:40:39,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:40:39,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1722496713, now seen corresponding path program 4 times [2022-11-20 11:40:39,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:40:39,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443720921] [2022-11-20 11:40:39,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:40:39,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:40:39,526 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:40:39,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1897689135] [2022-11-20 11:40:39,526 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:40:39,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:40:39,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:40:39,528 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:40:39,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30f35780-4aab-4c9d-8061-7f632e8d220b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:40:39,683 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:40:39,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:40:39,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-20 11:40:39,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:40:45,739 WARN L233 SmtUtils]: Spent 5.28s on a formula simplification. DAG size of input: 43 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)