./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_3_6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_3_6.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cefb3bae89bbacb2fe493d14201bba1802fb381afd861fd412b13151077489a8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:36:41,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:36:41,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:36:41,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:36:41,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:36:41,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:36:41,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:36:41,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:36:41,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:36:41,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:36:41,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:36:41,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:36:41,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:36:41,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:36:41,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:36:41,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:36:41,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:36:41,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:36:41,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:36:41,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:36:41,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:36:41,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:36:41,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:36:41,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:36:41,971 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:36:41,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:36:41,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:36:41,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:36:41,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:36:41,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:36:41,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:36:41,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:36:41,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:36:41,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:36:41,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:36:41,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:36:41,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:36:41,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:36:41,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:36:41,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:36:41,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:36:41,992 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:36:42,027 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:36:42,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:36:42,033 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:36:42,033 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:36:42,034 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:36:42,034 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:36:42,034 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:36:42,035 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:36:42,035 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:36:42,035 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:36:42,036 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:36:42,036 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:36:42,037 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:36:42,037 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:36:42,037 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:36:42,037 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:36:42,037 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:36:42,038 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:36:42,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:36:42,039 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:36:42,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:36:42,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:36:42,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:36:42,040 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:36:42,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:36:42,040 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:36:42,040 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:36:42,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:36:42,041 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:36:42,041 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:36:42,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:36:42,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:36:42,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:36:42,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:36:42,043 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:36:42,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:36:42,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:36:42,044 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:36:42,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:36:42,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:36:42,044 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:36:42,045 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_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/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_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cefb3bae89bbacb2fe493d14201bba1802fb381afd861fd412b13151077489a8 [2022-11-03 01:36:42,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:36:42,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:36:42,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:36:42,379 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:36:42,397 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:36:42,401 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/combinations/gcd_3+newton_3_6.i [2022-11-03 01:36:42,492 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/data/b193a1753/f19f6061cbdf4ef1bfd6636031cfa475/FLAG7bc457b84 [2022-11-03 01:36:43,111 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:36:43,114 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/sv-benchmarks/c/combinations/gcd_3+newton_3_6.i [2022-11-03 01:36:43,125 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/data/b193a1753/f19f6061cbdf4ef1bfd6636031cfa475/FLAG7bc457b84 [2022-11-03 01:36:43,137 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/data/b193a1753/f19f6061cbdf4ef1bfd6636031cfa475 [2022-11-03 01:36:43,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:36:43,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:36:43,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:36:43,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:36:43,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:36:43,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:36:43" (1/1) ... [2022-11-03 01:36:43,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@790d2d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:43, skipping insertion in model container [2022-11-03 01:36:43,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:36:43" (1/1) ... [2022-11-03 01:36:43,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:36:43,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:36:43,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/sv-benchmarks/c/combinations/gcd_3+newton_3_6.i[1226,1239] [2022-11-03 01:36:43,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/sv-benchmarks/c/combinations/gcd_3+newton_3_6.i[2862,2875] [2022-11-03 01:36:43,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:36:43,451 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:36:43,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/sv-benchmarks/c/combinations/gcd_3+newton_3_6.i[1226,1239] [2022-11-03 01:36:43,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/sv-benchmarks/c/combinations/gcd_3+newton_3_6.i[2862,2875] [2022-11-03 01:36:43,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:36:43,515 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:36:43,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:43 WrapperNode [2022-11-03 01:36:43,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:36:43,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:36:43,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:36:43,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:36:43,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:43" (1/1) ... [2022-11-03 01:36:43,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:43" (1/1) ... [2022-11-03 01:36:43,585 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 82 [2022-11-03 01:36:43,587 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:36:43,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:36:43,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:36:43,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:36:43,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:43" (1/1) ... [2022-11-03 01:36:43,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:43" (1/1) ... [2022-11-03 01:36:43,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:43" (1/1) ... [2022-11-03 01:36:43,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:43" (1/1) ... [2022-11-03 01:36:43,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:43" (1/1) ... [2022-11-03 01:36:43,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:43" (1/1) ... [2022-11-03 01:36:43,618 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:43" (1/1) ... [2022-11-03 01:36:43,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:43" (1/1) ... [2022-11-03 01:36:43,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:36:43,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:36:43,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:36:43,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:36:43,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:43" (1/1) ... [2022-11-03 01:36:43,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:36:43,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:36:43,663 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:36:43,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:36:43,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:36:43,708 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-03 01:36:43,708 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-03 01:36:43,708 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-03 01:36:43,708 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-03 01:36:43,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:36:43,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:36:43,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:36:43,794 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:36:43,796 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:36:44,092 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:36:44,215 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:36:44,223 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 01:36:44,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:36:44 BoogieIcfgContainer [2022-11-03 01:36:44,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:36:44,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:36:44,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:36:44,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:36:44,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:36:43" (1/3) ... [2022-11-03 01:36:44,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a12f59a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:36:44, skipping insertion in model container [2022-11-03 01:36:44,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:43" (2/3) ... [2022-11-03 01:36:44,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a12f59a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:36:44, skipping insertion in model container [2022-11-03 01:36:44,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:36:44" (3/3) ... [2022-11-03 01:36:44,239 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_3_6.i [2022-11-03 01:36:44,263 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:36:44,263 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 01:36:44,354 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:36:44,363 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1767c07a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:36:44,364 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-03 01:36:44,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 01:36:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 01:36:44,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:44,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 01:36:44,383 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:44,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:44,389 INFO L85 PathProgramCache]: Analyzing trace with hash -291944571, now seen corresponding path program 1 times [2022-11-03 01:36:44,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:44,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223054952] [2022-11-03 01:36:44,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:44,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:44,890 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-03 01:36:44,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:44,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223054952] [2022-11-03 01:36:44,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223054952] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:44,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:44,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:36:44,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156305861] [2022-11-03 01:36:44,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:44,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:36:44,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:44,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:36:44,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:36:44,939 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:36:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:45,164 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-11-03 01:36:45,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:36:45,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-03 01:36:45,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:45,176 INFO L225 Difference]: With dead ends: 48 [2022-11-03 01:36:45,176 INFO L226 Difference]: Without dead ends: 24 [2022-11-03 01:36:45,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:36:45,191 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:45,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 84 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:36:45,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-03 01:36:45,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-03 01:36:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 01:36:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-11-03 01:36:45,237 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 6 [2022-11-03 01:36:45,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:45,238 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-11-03 01:36:45,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:36:45,238 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-11-03 01:36:45,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 01:36:45,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:45,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:36:45,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:36:45,243 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:45,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:45,244 INFO L85 PathProgramCache]: Analyzing trace with hash -533010262, now seen corresponding path program 1 times [2022-11-03 01:36:45,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:45,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280074854] [2022-11-03 01:36:45,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:45,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:45,274 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 01:36:45,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1669139065] [2022-11-03 01:36:45,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:45,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:36:45,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:36:45,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:36:45,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:36:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:45,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-03 01:36:45,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:36:50,130 WARN L855 $PredicateComparison]: unable to prove that (or (and (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= |ULTIMATE.start_gcd_test_#res#1| 127))) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (and (< |c_ULTIMATE.start_main1_~x~0#1| 0) (let ((.cse1 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= .cse1 127))) (or (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= (mod (mod .cse1 |ULTIMATE.start_gcd_test_#res#1|) 256) 0)))) (and (let ((.cse3 (+ .cse1 (- 256)))) (or (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (let ((.cse2 (mod .cse3 |ULTIMATE.start_gcd_test_#res#1|))) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (not (= 0 .cse2)) (= (mod (+ (* 255 |ULTIMATE.start_gcd_test_#res#1|) .cse2) 256) 0) (<= 0 |ULTIMATE.start_gcd_test_#res#1|)))) (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= 0 (mod .cse3 |ULTIMATE.start_gcd_test_#res#1|)) (<= |ULTIMATE.start_gcd_test_#res#1| 127))))) (not .cse0))))))) is different from true [2022-11-03 01:36:50,375 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-03 01:36:50,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:36:51,969 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-03 01:36:51,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:51,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280074854] [2022-11-03 01:36:51,970 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 01:36:51,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669139065] [2022-11-03 01:36:51,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669139065] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:36:51,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [280019021] [2022-11-03 01:36:51,989 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 01:36:51,989 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:36:51,993 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:36:51,999 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:36:51,999 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:36:52,338 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:36:53,449 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '187#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (<= |ULTIMATE.start_gcd_test_#in~a#1| 127) (< 0 |ULTIMATE.start_main1_~x~0#1|) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (ite (<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~x~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= |ULTIMATE.start_main1_~y~0#1| 127) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main1_~y~0#1| 128)) (= |#NULL.base| 0))' at error location [2022-11-03 01:36:53,450 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:36:53,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:36:53,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-11-03 01:36:53,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597075311] [2022-11-03 01:36:53,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:36:53,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 01:36:53,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:53,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 01:36:53,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2022-11-03 01:36:53,453 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-03 01:36:55,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 01:38:31,671 WARN L234 SmtUtils]: Spent 1.56m on a formula simplification. DAG size of input: 105 DAG size of output: 101 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:38:31,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:31,729 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-11-03 01:38:31,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:38:31,731 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 7 [2022-11-03 01:38:31,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:31,732 INFO L225 Difference]: With dead ends: 29 [2022-11-03 01:38:31,732 INFO L226 Difference]: Without dead ends: 25 [2022-11-03 01:38:31,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 100.9s TimeCoverageRelationStatistics Valid=40, Invalid=145, Unknown=1, NotChecked=24, Total=210 [2022-11-03 01:38:31,734 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:31,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 1 Unknown, 36 Unchecked, 2.8s Time] [2022-11-03 01:38:31,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-03 01:38:31,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-03 01:38:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 01:38:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-11-03 01:38:31,744 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 7 [2022-11-03 01:38:31,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:31,745 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-03 01:38:31,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-03 01:38:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-11-03 01:38:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 01:38:31,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:31,747 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-03 01:38:31,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-03 01:38:31,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-03 01:38:31,963 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:38:31,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:31,963 INFO L85 PathProgramCache]: Analyzing trace with hash 583887909, now seen corresponding path program 2 times [2022-11-03 01:38:31,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:31,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065613403] [2022-11-03 01:38:31,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:31,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:31,974 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 01:38:31,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1440736872] [2022-11-03 01:38:31,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:38:31,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:31,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:31,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:31,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:38:32,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:38:32,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:38:32,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 01:38:32,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:53,387 WARN L234 SmtUtils]: Spent 18.57s on a formula simplification. DAG size of input: 62 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:39:01,280 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse9 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse8 (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (.cse3 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse10 (<= .cse9 127))) (let ((.cse13 (not .cse10)) (.cse12 (+ .cse9 (- 256))) (.cse2 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse15 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse17 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse4 (not .cse3)) (.cse7 (not .cse8))) (or (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse1 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= .cse0 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse0 256)) (= .cse1 .cse2) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (<= .cse1 127))))) .cse3) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse6 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= .cse5 0) (<= .cse6 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse5 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= .cse6 |c_ULTIMATE.start_gcd_test_~a#1|)))))) .cse7) (and .cse8 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse9 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)))) .cse10 .cse4) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse11 (mod .cse12 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (= .cse11 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= .cse2 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) .cse11) 256))))) .cse3 .cse13))) (and .cse8 (or (and .cse3 .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse14 0)) (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse14) 256) .cse15) (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0) (= .cse2 (mod (+ (mod .cse12 |v_ULTIMATE.start_gcd_test_~a#1_27|) |v_ULTIMATE.start_gcd_test_~a#1_27|) 256)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse16 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse9 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256)) (= .cse15 (mod (+ .cse17 .cse16) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)))) .cse10 .cse4))) (and (or (and .cse10 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse18 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse9 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse18 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0))))) .cse4) (and .cse3 .cse13 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse20 (mod .cse12 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (and (= .cse19 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse19 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (= .cse20 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= .cse2 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) .cse20) 256))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse22 (mod .cse12 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (and (= .cse21 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse21 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0) (not (= .cse22 0)) (= .cse2 (mod (+ .cse22 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256)))))))) .cse8) (and (or (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse23 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= .cse23 .cse2) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (<= .cse23 127)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse24 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (<= .cse24 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= .cse24 |c_ULTIMATE.start_gcd_test_~a#1|)))) .cse4)) .cse7) (and (or (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse26 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (not (= .cse25 0)) (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse25) 256) .cse15) (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0) (= .cse26 .cse2) (not (<= .cse26 127)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse27 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (<= .cse27 127) (not (= .cse28 0)) (= .cse15 (mod (+ .cse17 .cse28) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0) (= .cse27 |c_ULTIMATE.start_gcd_test_~a#1|)))) .cse4)) .cse7))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-03 01:39:06,066 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse9 (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (.cse4 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse7 (+ .cse2 (- 256)))) (let ((.cse8 (< 127 .cse2)) (.cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse17 (mod .cse7 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (let ((.cse16 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) .cse17) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ .cse16 (- 256))) 256) 0) (not (= .cse17 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (<= .cse4 .cse16)))))) (.cse0 (<= .cse2 127)) (.cse12 (not .cse9))) (or (and (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse1 (mod (mod .cse2 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse1)) (not (= 0 .cse1)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse1) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)))))) (and (or .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse6 (mod .cse7 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (let ((.cse5 (mod (+ .cse6 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (<= .cse4 .cse5) (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ (- 256) .cse5)) 0) (not (= .cse6 0))))))) .cse8)) .cse9) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse10 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ .cse10 (- 256))) 256) 0) (<= .cse4 .cse10) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (<= .cse10 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse11 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (<= .cse11 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse11) (not (= .cse11 0)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse11) 256) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)))))) .cse12) (and .cse9 (or (and .cse8 .cse3) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse13 (mod (mod .cse2 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (not (= 0 .cse13)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse13) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse13) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0))))) .cse0))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse14 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (<= .cse14 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse14) (not (= .cse14 0)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse14) 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse15 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ .cse15 (- 256))) 0) (<= .cse4 .cse15) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (<= .cse15 127)))))) .cse12))))) is different from false [2022-11-03 01:39:08,643 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse9 (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (.cse4 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse7 (+ .cse2 (- 256)))) (let ((.cse8 (< 127 .cse2)) (.cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse17 (mod .cse7 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (let ((.cse16 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) .cse17) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ .cse16 (- 256))) 256) 0) (not (= .cse17 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (<= .cse4 .cse16)))))) (.cse0 (<= .cse2 127)) (.cse12 (not .cse9))) (or (and (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse1 (mod (mod .cse2 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse1)) (not (= 0 .cse1)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse1) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)))))) (and (or .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse6 (mod .cse7 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (let ((.cse5 (mod (+ .cse6 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (<= .cse4 .cse5) (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ (- 256) .cse5)) 0) (not (= .cse6 0))))))) .cse8)) .cse9) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse10 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ .cse10 (- 256))) 256) 0) (<= .cse4 .cse10) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (<= .cse10 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse11 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (<= .cse11 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse11) (not (= .cse11 0)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse11) 256) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)))))) .cse12) (and .cse9 (or (and .cse8 .cse3) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse13 (mod (mod .cse2 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (not (= 0 .cse13)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse13) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse13) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0))))) .cse0))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse14 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (<= .cse14 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse14) (not (= .cse14 0)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse14) 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse15 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ .cse15 (- 256))) 0) (<= .cse4 .cse15) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (<= .cse15 127)))))) .cse12))))) is different from true [2022-11-03 01:39:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:39:10,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:39:40,277 WARN L855 $PredicateComparison]: unable to prove that (or (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (let ((.cse6 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse13 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse3 (not .cse6)) (.cse2 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse0) 256))) (or (< 127 (mod .cse0 256)) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse0) 256) 127) (= .cse0 0) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse1) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse1) 256) 0)) (< .cse1 .cse2))))) .cse3) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse4 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod .cse4 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse5) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse4) 256) 127)) (not (<= .cse5 127)) (< .cse5 .cse2))))) .cse6) (or .cse3 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse7 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse7) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse8) 256) 0)) (not (<= .cse8 127)) (< .cse8 .cse2) (not (<= (mod .cse7 256) 127))))))) (or .cse3 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse9 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse10 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse9) 256))) (or (< 127 (mod .cse9 256)) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse10) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse9) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 0)) (< .cse10 .cse2)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse12 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse12) 256))) (or (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse11) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse12) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse11) 256) 0)) (< .cse11 .cse2) (<= (mod .cse12 256) 127))))) .cse13) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod .cse15 256))) (or (< 127 .cse14) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse15) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse14) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse15) 256)) (< .cse14 .cse2))))) .cse6) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse17 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse17) 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0)) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse17) 256) 127) (not (<= .cse16 127)) (< .cse16 .cse2) (<= (mod .cse17 256) 127))))) .cse3) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse19 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod .cse19 256))) (or (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse18) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse19) 256) 127)) (not (<= .cse18 127)) (< .cse18 .cse2)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse21 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse21) 256))) (or (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse20) 256) 0)) (= .cse21 0) (not (<= .cse20 127)) (< .cse20 .cse2) (not (<= (mod .cse21 256) 127)))))) .cse3) (or .cse13 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse22 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse23 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse22) 256))) (or (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse22) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse23) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse23) 256) 0)) (< .cse23 .cse2) (<= (mod .cse22 256) 127)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse24 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse24) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse24) 256) 127)) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse25) 256) 0)) (not (<= .cse25 127)) (< .cse25 .cse2) (<= (mod .cse24 256) 127))))) .cse3) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod .cse26 256))) (or (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse26) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0)) (not (<= .cse27 127)) (< .cse27 .cse2)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod .cse28 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse28) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 0)) (not (<= .cse29 127)) (< .cse29 .cse2))))) .cse6) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse30 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod .cse30 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 127)) (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse30) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse31) 256) 0)) (not (<= .cse31 127)) (< .cse31 .cse2)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse33 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse32 (mod .cse33 256))) (or (= |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse32) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse33) 256) 127)) (not (<= .cse32 127)) (< .cse32 .cse2))))) .cse6) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse35 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod .cse35 256))) (or (< 127 .cse34) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse35) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse35) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse34) 256) 0)) (< .cse34 .cse2)))))))))) is different from true [2022-11-03 01:39:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:39:40,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:40,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065613403] [2022-11-03 01:39:40,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 01:39:40,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440736872] [2022-11-03 01:39:40,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440736872] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:39:40,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1746332491] [2022-11-03 01:39:40,857 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 01:39:40,857 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:39:40,858 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:39:40,858 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:39:40,858 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:39:41,067 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:39:43,581 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '323#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (<= |ULTIMATE.start_gcd_test_#in~a#1| 127) (< 0 |ULTIMATE.start_main1_~x~0#1|) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (ite (<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~x~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= |ULTIMATE.start_main1_~y~0#1| 127) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main1_~y~0#1| 128)) (= |#NULL.base| 0))' at error location [2022-11-03 01:39:43,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:39:43,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:39:43,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-11-03 01:39:43,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476729849] [2022-11-03 01:39:43,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:39:43,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 01:39:43,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:43,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 01:39:43,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=122, Unknown=4, NotChecked=72, Total=240 [2022-11-03 01:39:43,583 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-03 01:39:45,684 WARN L855 $PredicateComparison]: unable to prove that (and (let ((.cse0 (< |c_ULTIMATE.start_main1_~x~0#1| 0))) (or (and (= |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~x~0#1|) (not .cse0)) (and .cse0 (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse1 (<= .cse2 127))) (or (and (not .cse1) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse2)) (and (= .cse2 |c_ULTIMATE.start_gcd_test_~a#1|) .cse1))))))) (or (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (let ((.cse9 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse16 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse6 (not .cse9)) (.cse5 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse3 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse4 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse3) 256))) (or (< 127 (mod .cse3 256)) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse3) 256) 127) (= .cse3 0) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse4) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)) (< .cse4 .cse5))))) .cse6) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse7 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod .cse7 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse8) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse7) 256) 127)) (not (<= .cse8 127)) (< .cse8 .cse5))))) .cse9) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse10 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse10) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse11) 256) 0)) (not (<= .cse11 127)) (< .cse11 .cse5) (not (<= (mod .cse10 256) 127))))))) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse12 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse12) 256))) (or (< 127 (mod .cse12 256)) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse13) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse12) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse13) 256) 0)) (< .cse13 .cse5)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse15) 256))) (or (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse14) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse15) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse14) 256) 0)) (< .cse14 .cse5) (<= (mod .cse15 256) 127))))) .cse16) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse18 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod .cse18 256))) (or (< 127 .cse17) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse18) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse17) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse18) 256)) (< .cse17 .cse5))))) .cse9) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse20 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse20) 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0)) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse20) 256) 127) (not (<= .cse19 127)) (< .cse19 .cse5) (<= (mod .cse20 256) 127))))) .cse6) (or .cse9 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse22 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod .cse22 256))) (or (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse21) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse22) 256) 127)) (not (<= .cse21 127)) (< .cse21 .cse5)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse24 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse23 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse24) 256))) (or (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse23) 256) 0)) (= .cse24 0) (not (<= .cse23 127)) (< .cse23 .cse5) (not (<= (mod .cse24 256) 127)))))) .cse6) (or .cse16 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse25 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse25) 256))) (or (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse25) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse26) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse26) 256) 0)) (< .cse26 .cse5) (<= (mod .cse25 256) 127)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse27 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse27) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 127)) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0)) (not (<= .cse28 127)) (< .cse28 .cse5) (<= (mod .cse27 256) 127))))) .cse6) (or .cse9 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod .cse29 256))) (or (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse29) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0)) (not (<= .cse30 127)) (< .cse30 .cse5)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse31 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse32 (mod .cse31 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse31) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse32) 256) 0)) (not (<= .cse32 127)) (< .cse32 .cse5))))) .cse9) (or .cse9 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse33 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod .cse33 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse33) 256) 127)) (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse33) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse34) 256) 0)) (not (<= .cse34 127)) (< .cse34 .cse5)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse36 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod .cse36 256))) (or (= |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse35) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse36) 256) 127)) (not (<= .cse35 127)) (< .cse35 .cse5))))) .cse9) (or .cse9 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse38 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse37 (mod .cse38 256))) (or (< 127 .cse37) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse38) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse38) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse37) 256) 0)) (< .cse37 .cse5))))))))))) is different from true [2022-11-03 01:39:48,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 01:39:50,658 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (< |c_ULTIMATE.start_gcd_test_~a#1| (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (let ((.cse9 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse8 (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (.cse3 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse10 (<= .cse9 127))) (let ((.cse13 (not .cse10)) (.cse12 (+ .cse9 (- 256))) (.cse2 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse15 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse17 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse4 (not .cse3)) (.cse7 (not .cse8))) (or (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse1 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= .cse0 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse0 256)) (= .cse1 .cse2) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (<= .cse1 127))))) .cse3) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse6 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= .cse5 0) (<= .cse6 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse5 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= .cse6 |c_ULTIMATE.start_gcd_test_~a#1|)))))) .cse7) (and .cse8 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse9 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)))) .cse10 .cse4) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse11 (mod .cse12 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (= .cse11 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= .cse2 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) .cse11) 256))))) .cse3 .cse13))) (and .cse8 (or (and .cse3 .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse14 0)) (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse14) 256) .cse15) (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0) (= .cse2 (mod (+ (mod .cse12 |v_ULTIMATE.start_gcd_test_~a#1_27|) |v_ULTIMATE.start_gcd_test_~a#1_27|) 256)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse16 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse9 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256)) (= .cse15 (mod (+ .cse17 .cse16) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)))) .cse10 .cse4))) (and (or (and .cse10 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse18 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse9 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse18 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0))))) .cse4) (and .cse3 .cse13 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse20 (mod .cse12 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (and (= .cse19 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse19 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (= .cse20 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= .cse2 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) .cse20) 256))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse22 (mod .cse12 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (and (= .cse21 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse21 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0) (not (= .cse22 0)) (= .cse2 (mod (+ .cse22 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256)))))))) .cse8) (and (or (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse23 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= .cse23 .cse2) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (<= .cse23 127)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse24 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (<= .cse24 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= .cse24 |c_ULTIMATE.start_gcd_test_~a#1|)))) .cse4)) .cse7) (and (or (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse26 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (not (= .cse25 0)) (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse25) 256) .cse15) (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0) (= .cse26 .cse2) (not (<= .cse26 127)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse27 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (<= .cse27 127) (not (= .cse28 0)) (= .cse15 (mod (+ .cse17 .cse28) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0) (= .cse27 |c_ULTIMATE.start_gcd_test_~a#1|)))) .cse4)) .cse7))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-03 01:39:52,750 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse9 (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (.cse4 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse7 (+ .cse2 (- 256)))) (let ((.cse8 (< 127 .cse2)) (.cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse17 (mod .cse7 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (let ((.cse16 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) .cse17) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ .cse16 (- 256))) 256) 0) (not (= .cse17 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (<= .cse4 .cse16)))))) (.cse0 (<= .cse2 127)) (.cse12 (not .cse9))) (or (and (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse1 (mod (mod .cse2 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse1)) (not (= 0 .cse1)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse1) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)))))) (and (or .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse6 (mod .cse7 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (let ((.cse5 (mod (+ .cse6 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (<= .cse4 .cse5) (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ (- 256) .cse5)) 0) (not (= .cse6 0))))))) .cse8)) .cse9) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse10 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ .cse10 (- 256))) 256) 0) (<= .cse4 .cse10) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (<= .cse10 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse11 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (<= .cse11 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse11) (not (= .cse11 0)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse11) 256) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)))))) .cse12) (and .cse9 (or (and .cse8 .cse3) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse13 (mod (mod .cse2 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (not (= 0 .cse13)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse13) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse13) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0))))) .cse0))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse14 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (<= .cse14 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse14) (not (= .cse14 0)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse14) 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse15 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ .cse15 (- 256))) 0) (<= .cse4 .cse15) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (<= .cse15 127)))))) .cse12))))) (or (<= |c_ULTIMATE.start_main1_~g~0#1| |c_ULTIMATE.start_main1_~x~0#1|) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)))) is different from false [2022-11-03 01:39:55,712 WARN L855 $PredicateComparison]: unable to prove that (and (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse9 (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (.cse4 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse7 (+ .cse2 (- 256)))) (let ((.cse8 (< 127 .cse2)) (.cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse17 (mod .cse7 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (let ((.cse16 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) .cse17) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ .cse16 (- 256))) 256) 0) (not (= .cse17 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (<= .cse4 .cse16)))))) (.cse0 (<= .cse2 127)) (.cse12 (not .cse9))) (or (and (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse1 (mod (mod .cse2 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse1)) (not (= 0 .cse1)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse1) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)))))) (and (or .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse6 (mod .cse7 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (let ((.cse5 (mod (+ .cse6 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (<= .cse4 .cse5) (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ (- 256) .cse5)) 0) (not (= .cse6 0))))))) .cse8)) .cse9) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse10 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ .cse10 (- 256))) 256) 0) (<= .cse4 .cse10) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (<= .cse10 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse11 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (<= .cse11 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse11) (not (= .cse11 0)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse11) 256) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)))))) .cse12) (and .cse9 (or (and .cse8 .cse3) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse13 (mod (mod .cse2 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (not (= 0 .cse13)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse13) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse13) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0))))) .cse0))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse14 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (<= .cse14 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse14) (not (= .cse14 0)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse14) 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse15 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ .cse15 (- 256))) 0) (<= .cse4 .cse15) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (<= .cse15 127)))))) .cse12))))) (or (<= |c_ULTIMATE.start_main1_~g~0#1| |c_ULTIMATE.start_main1_~x~0#1|) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)))) is different from true [2022-11-03 01:39:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:55,980 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-11-03 01:39:55,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:39:55,981 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 01:39:55,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:55,982 INFO L225 Difference]: With dead ends: 30 [2022-11-03 01:39:55,983 INFO L226 Difference]: Without dead ends: 26 [2022-11-03 01:39:55,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 41.5s TimeCoverageRelationStatistics Valid=48, Invalid=124, Unknown=8, NotChecked=162, Total=342 [2022-11-03 01:39:55,985 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:55,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 1 Unknown, 61 Unchecked, 3.3s Time] [2022-11-03 01:39:55,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-03 01:39:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-03 01:39:55,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 01:39:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-11-03 01:39:55,999 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 8 [2022-11-03 01:39:55,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:56,000 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-11-03 01:39:56,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-03 01:39:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-11-03 01:39:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 01:39:56,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:56,001 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2022-11-03 01:39:56,029 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:56,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:56,206 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:56,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:56,206 INFO L85 PathProgramCache]: Analyzing trace with hash 847992842, now seen corresponding path program 3 times [2022-11-03 01:39:56,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:56,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286891693] [2022-11-03 01:39:56,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:56,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:56,217 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 01:39:56,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [109838107] [2022-11-03 01:39:56,226 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:39:56,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:56,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:56,232 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:56,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:39:56,404 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:39:56,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:39:56,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:39:56,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:40:26,920 WARN L234 SmtUtils]: Spent 26.08s on a formula simplification. DAG size of input: 76 DAG size of output: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:44:26,701 WARN L234 SmtUtils]: Spent 3.78m on a formula simplification. DAG size of input: 105 DAG size of output: 102 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:44:57,334 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse24 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse21 (<= .cse24 127)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse14 (< |c_ULTIMATE.start_main1_~x~0#1| 0))) (let ((.cse7 (not .cse14)) (.cse19 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse5 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse8 (not .cse0)) (.cse15 (not .cse21)) (.cse20 (+ .cse24 (- 256)))) (or (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse1 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse6 (+ (- 256) .cse1))) (let ((.cse3 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse6) 256))) (let ((.cse4 (mod .cse6 .cse3)) (.cse2 (mod .cse3 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse1 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse2 256)) (not (= .cse3 0)) (not (= .cse4 0)) (= .cse5 (mod (+ .cse4 (* .cse3 255)) 256)) (= .cse2 0))))))) .cse7) (and .cse8 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse10 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse9 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse10) 256))) (and (not (= .cse9 0)) (<= .cse10 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse10 .cse9) 256)) (= (mod (mod .cse9 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|))))) .cse7) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse12 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse11 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse12) 256))) (let ((.cse13 (mod .cse11 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse11 0)) (<= .cse12 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse12 .cse11) 256)) (= (mod .cse13 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse13 0)))))) .cse8 .cse7) (and .cse14 .cse15 .cse8 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse16 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse18 (+ (- 256) (mod (+ (mod .cse20 .cse16) (* 255 .cse16)) 256)))) (let ((.cse17 (mod .cse18 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse16 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse17 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse16 .cse18) 256)) (= .cse19 (mod (+ .cse17 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) 256)))))))) (and .cse14 .cse21 .cse8 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse22 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse23 (mod (mod .cse24 .cse22) 256))) (and (<= .cse22 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse23 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse23 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse22 .cse23) 256))))))) (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse25 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse28 (+ (- 256) .cse25))) (let ((.cse26 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse28) 256))) (let ((.cse27 (mod .cse28 .cse26))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse25 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse26 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse26 0)) (not (= .cse27 0)) (= .cse5 (mod (+ .cse27 (* .cse26 255)) 256)))))))) .cse7) (and .cse0 .cse14 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse33 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse31 (+ (- 256) .cse33))) (let ((.cse30 (mod (+ (mod .cse20 .cse31) .cse33) 256))) (let ((.cse32 (+ (- 256) .cse30))) (let ((.cse29 (mod .cse32 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse29 0)) (= .cse5 (mod (+ .cse30 (mod .cse31 .cse32)) 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse33 127)) (= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse19)))))))) .cse15) (and .cse14 (or (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse37 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse38 (+ (- 256) .cse37))) (let ((.cse34 (mod (+ (mod .cse20 .cse38) .cse37) 256))) (let ((.cse39 (+ (- 256) .cse34))) (let ((.cse36 (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse35 (mod .cse38 .cse39))) (and (= .cse5 (mod (+ .cse34 .cse35) 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (= .cse36 0) (not (<= .cse37 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse36 256)) (not (= .cse35 0))))))))) .cse15) (and .cse0 .cse21 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse42 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse44 (+ (- 256) .cse42))) (let ((.cse43 (mod (mod .cse24 .cse44) 256))) (let ((.cse40 (mod .cse44 .cse43)) (.cse41 (mod .cse43 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse40 0)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (= 0 .cse41) (not (<= .cse42 127)) (= .cse5 (mod (+ .cse40 (* 255 .cse43)) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse41 256)) (not (= .cse43 0))))))))))) (and .cse0 .cse14 .cse21 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse46 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse48 (+ (- 256) .cse46))) (let ((.cse47 (mod (mod .cse24 .cse48) 256))) (let ((.cse45 (mod .cse48 .cse47))) (and (not (= .cse45 0)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse46 127)) (= .cse5 (mod (+ .cse45 (* 255 .cse47)) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse47 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse47 0))))))))) (and .cse14 .cse8 (or (and .cse21 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse49 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse51 (mod (mod .cse24 .cse49) 256))) (let ((.cse50 (mod .cse51 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse49 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse50 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse51 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse49 .cse51) 256)) (= .cse50 0))))))) (and .cse15 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse52 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse54 (+ (- 256) (mod (+ (mod .cse20 .cse52) (* 255 .cse52)) 256)))) (let ((.cse53 (mod .cse54 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse52 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse53 256)) (= .cse53 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse52 .cse54) 256)))))))))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-03 01:45:07,114 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse12 (+ .cse8 (- 256))) (.cse19 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse3 (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (.cse4 (<= .cse8 127)) (.cse13 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|))) (or (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse1 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse0 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse1) 256))) (let ((.cse2 (mod (mod .cse1 .cse0) 256))) (and (not (= .cse0 0)) (<= .cse1 127) (= (mod (mod .cse0 .cse2) 256) 0) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse2 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse2)))))) (not .cse3)) (and .cse3 (or (and .cse4 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse7 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse5 (mod (mod .cse8 .cse7) 256))) (let ((.cse6 (mod (mod .cse7 .cse5) 256))) (and (= (mod .cse5 .cse6) 0) (<= .cse7 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse5 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse6) (not (= .cse6 0)))))))) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse9 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse11 (+ (- 256) (mod (+ (mod .cse12 .cse9) (* 255 .cse9)) 256)))) (let ((.cse10 (mod (mod .cse9 .cse11) 256))) (and (<= .cse9 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse10 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse10) (= (mod (mod .cse11 .cse10) 256) 0)))))) (not .cse4)))) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse15 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse18 (+ (- 256) .cse15))) (let ((.cse16 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse18) 256))) (let ((.cse17 (mod .cse18 .cse16))) (let ((.cse14 (mod (+ .cse17 (* .cse16 255)) 256))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= .cse13 .cse14) (not (<= .cse15 127)) (not (= .cse16 0)) (not (= .cse17 0)) (= (mod (mod .cse16 (+ .cse14 (- 256))) 256) 0)))))))) .cse19) (and .cse3 (or (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse23 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse24 (+ (- 256) .cse23))) (let ((.cse22 (mod (mod .cse8 .cse24) 256))) (let ((.cse21 (mod .cse24 .cse22))) (let ((.cse20 (mod (+ .cse21 (* 255 .cse22)) 256))) (and (<= .cse13 .cse20) (not (= .cse21 0)) (= (mod .cse22 (+ (- 256) .cse20)) 0) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse23 127)) (not (= .cse22 0))))))))) .cse4) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse26 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse30 (+ (- 256) .cse26))) (let ((.cse29 (mod (+ (mod .cse12 .cse30) .cse26) 256))) (let ((.cse27 (+ (- 256) .cse29))) (let ((.cse28 (mod .cse30 .cse27))) (let ((.cse25 (mod (+ .cse29 .cse28) 256))) (and (<= .cse13 .cse25) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse26 127)) (= (mod .cse27 (+ (- 256) .cse25)) 0) (not (= .cse28 0)))))))))) (< 127 .cse8)))) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse32 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse35 (+ (- 256) .cse32))) (let ((.cse33 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse35) 256))) (let ((.cse34 (mod .cse35 .cse33))) (let ((.cse31 (mod (+ .cse34 (* .cse33 255)) 256))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= .cse13 .cse31) (not (<= .cse32 127)) (not (= .cse33 0)) (= (mod .cse33 (+ .cse31 (- 256))) 0) (not (= .cse34 0))))))))) .cse19) (and .cse3 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse36 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse37 (mod (mod .cse8 .cse36) 256))) (let ((.cse38 (mod (mod .cse36 .cse37) 256))) (and (<= .cse36 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse37 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse38) (= (mod (mod .cse37 .cse38) 256) 0) (not (= .cse38 0))))))) .cse4) (and .cse3 .cse4 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse41 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse43 (+ (- 256) .cse41))) (let ((.cse42 (mod (mod .cse8 .cse43) 256))) (let ((.cse40 (mod .cse43 .cse42))) (let ((.cse39 (mod (+ .cse40 (* 255 .cse42)) 256))) (and (<= .cse13 .cse39) (not (= .cse40 0)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse41 127)) (= (mod (mod .cse42 (+ (- 256) .cse39)) 256) 0) (not (= .cse42 0))))))))))))) is different from false [2022-11-03 01:45:09,130 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse12 (+ .cse8 (- 256))) (.cse19 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse3 (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (.cse4 (<= .cse8 127)) (.cse13 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|))) (or (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse1 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse0 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse1) 256))) (let ((.cse2 (mod (mod .cse1 .cse0) 256))) (and (not (= .cse0 0)) (<= .cse1 127) (= (mod (mod .cse0 .cse2) 256) 0) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse2 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse2)))))) (not .cse3)) (and .cse3 (or (and .cse4 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse7 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse5 (mod (mod .cse8 .cse7) 256))) (let ((.cse6 (mod (mod .cse7 .cse5) 256))) (and (= (mod .cse5 .cse6) 0) (<= .cse7 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse5 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse6) (not (= .cse6 0)))))))) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse9 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse11 (+ (- 256) (mod (+ (mod .cse12 .cse9) (* 255 .cse9)) 256)))) (let ((.cse10 (mod (mod .cse9 .cse11) 256))) (and (<= .cse9 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse10 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse10) (= (mod (mod .cse11 .cse10) 256) 0)))))) (not .cse4)))) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse15 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse18 (+ (- 256) .cse15))) (let ((.cse16 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse18) 256))) (let ((.cse17 (mod .cse18 .cse16))) (let ((.cse14 (mod (+ .cse17 (* .cse16 255)) 256))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= .cse13 .cse14) (not (<= .cse15 127)) (not (= .cse16 0)) (not (= .cse17 0)) (= (mod (mod .cse16 (+ .cse14 (- 256))) 256) 0)))))))) .cse19) (and .cse3 (or (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse23 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse24 (+ (- 256) .cse23))) (let ((.cse22 (mod (mod .cse8 .cse24) 256))) (let ((.cse21 (mod .cse24 .cse22))) (let ((.cse20 (mod (+ .cse21 (* 255 .cse22)) 256))) (and (<= .cse13 .cse20) (not (= .cse21 0)) (= (mod .cse22 (+ (- 256) .cse20)) 0) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse23 127)) (not (= .cse22 0))))))))) .cse4) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse26 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse30 (+ (- 256) .cse26))) (let ((.cse29 (mod (+ (mod .cse12 .cse30) .cse26) 256))) (let ((.cse27 (+ (- 256) .cse29))) (let ((.cse28 (mod .cse30 .cse27))) (let ((.cse25 (mod (+ .cse29 .cse28) 256))) (and (<= .cse13 .cse25) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse26 127)) (= (mod .cse27 (+ (- 256) .cse25)) 0) (not (= .cse28 0)))))))))) (< 127 .cse8)))) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse32 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse35 (+ (- 256) .cse32))) (let ((.cse33 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse35) 256))) (let ((.cse34 (mod .cse35 .cse33))) (let ((.cse31 (mod (+ .cse34 (* .cse33 255)) 256))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= .cse13 .cse31) (not (<= .cse32 127)) (not (= .cse33 0)) (= (mod .cse33 (+ .cse31 (- 256))) 0) (not (= .cse34 0))))))))) .cse19) (and .cse3 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse36 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse37 (mod (mod .cse8 .cse36) 256))) (let ((.cse38 (mod (mod .cse36 .cse37) 256))) (and (<= .cse36 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse37 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse38) (= (mod (mod .cse37 .cse38) 256) 0) (not (= .cse38 0))))))) .cse4) (and .cse3 .cse4 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse41 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse43 (+ (- 256) .cse41))) (let ((.cse42 (mod (mod .cse8 .cse43) 256))) (let ((.cse40 (mod .cse43 .cse42))) (let ((.cse39 (mod (+ .cse40 (* 255 .cse42)) 256))) (and (<= .cse13 .cse39) (not (= .cse40 0)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse41 127)) (= (mod (mod .cse42 (+ (- 256) .cse39)) 256) 0) (not (= .cse42 0))))))))))))) is different from true [2022-11-03 01:45:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 01:45:14,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:45:33,209 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (let ((.cse18 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod (+ .cse18 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse22 (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse1 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse15 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse8 (<= .cse22 127)) (.cse20 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse10 (<= .cse21 127)) (.cse19 (mod .cse18 256))) (let ((.cse11 (<= .cse19 127)) (.cse9 (not .cse10)) (.cse4 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse22) 256) 0))) (.cse6 (< .cse22 .cse20)) (.cse7 (not .cse8)) (.cse0 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse21) 256) 0))) (.cse2 (< .cse21 .cse20)) (.cse3 (not .cse15)) (.cse5 (not .cse1))) (and (or (and (or (and (or (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse3)) .cse7) (or .cse0 .cse1 .cse2 .cse8 .cse3)) .cse9) (or .cse4 .cse5 .cse6 .cse10 .cse7 .cse3)) .cse11) (or (not .cse11) (let ((.cse16 (< .cse19 .cse20)) (.cse17 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0)))) (let ((.cse13 (or .cse15 .cse16 .cse17)) (.cse14 (= .cse18 0)) (.cse12 (or .cse15 .cse16 .cse1 .cse17))) (and (or .cse7 (and .cse12 (or .cse5 (and .cse13 (or .cse4 .cse14 .cse6 .cse3))))) (or .cse9 (and (or (and (or .cse5 (and (or .cse4 .cse6 .cse3) .cse13)) (or (and (or .cse0 .cse2 .cse3) .cse13) .cse1)) .cse7) (or .cse8 (and .cse13 (or (and .cse13 (or .cse14 .cse0 .cse2 .cse3)) .cse1))))) (or .cse8 (and .cse12 (or .cse15 .cse5 .cse16 .cse17)))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from false [2022-11-03 01:47:36,019 WARN L855 $PredicateComparison]: unable to prove that (or (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod (+ .cse15 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse26 (+ (- 256) .cse29)) (.cse18 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse19 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse28 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29) 256))) (let ((.cse0 (<= .cse29 127)) (.cse11 (= .cse29 0)) (.cse12 (not (= (mod (mod .cse29 .cse28) 256) 0))) (.cse13 (< .cse28 .cse19)) (.cse7 (not .cse18)) (.cse14 (<= (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (.cse27 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse26) 256)) (.cse16 (mod .cse15 256))) (let ((.cse20 (<= .cse16 127)) (.cse4 (< .cse27 .cse19)) (.cse6 (not (= (mod (mod .cse26 .cse27) 256) 0))) (.cse2 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse3 (not .cse14)) (.cse10 (or .cse11 .cse12 .cse13 .cse7)) (.cse9 (not .cse0))) (and (or (let ((.cse8 (let ((.cse17 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256))) (or (not (= (mod (mod .cse16 .cse17) 256) 0)) .cse18 (< .cse17 .cse19) (= .cse16 0)))) (.cse5 (= .cse15 0))) (and (or .cse0 (let ((.cse1 (and (or .cse4 .cse5 .cse6 .cse7) .cse8))) (and (or .cse1 .cse2 .cse3) (or .cse1 .cse2)))) (or .cse9 (and (or (and .cse8 .cse10) .cse2 .cse3) (or (and .cse8 (or .cse5 .cse11 .cse12 .cse13 .cse7)) .cse2 .cse14))))) (not .cse20)) (or .cse20 (let ((.cse22 (let ((.cse25 (+ (- 256) .cse16))) (let ((.cse24 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse25) 256))) (or .cse18 (< .cse24 .cse19) (not (= 0 (mod (mod .cse25 .cse24) 256)))))))) (and (or (let ((.cse21 (and (or .cse4 .cse6 .cse7) .cse22))) (and (or .cse2 .cse14 .cse21) (or .cse2 .cse3 .cse21))) .cse0) (or (let ((.cse23 (and .cse22 .cse10))) (and (or .cse23 .cse2 .cse14) (or .cse23 .cse2 .cse3))) .cse9))))))))))) is different from true [2022-11-03 01:47:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 01:47:36,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:47:36,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286891693] [2022-11-03 01:47:36,154 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 01:47:36,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109838107] [2022-11-03 01:47:36,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109838107] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:36,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [309244559] [2022-11-03 01:47:36,157 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 01:47:36,157 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:47:36,158 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:47:36,158 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:47:36,158 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:47:36,281 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:47:47,828 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '475#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (<= |ULTIMATE.start_gcd_test_#in~a#1| 127) (< 0 |ULTIMATE.start_main1_~x~0#1|) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (ite (<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~x~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= |ULTIMATE.start_main1_~y~0#1| 127) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main1_~y~0#1| 128)) (= |#NULL.base| 0))' at error location [2022-11-03 01:47:47,828 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:47:47,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:47:47,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-11-03 01:47:47,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515323380] [2022-11-03 01:47:47,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:47:47,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:47:47,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:47:47,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:47:47,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=137, Unknown=13, NotChecked=108, Total=306 [2022-11-03 01:47:47,831 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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-03 01:47:53,823 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse24 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse21 (<= .cse24 127)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse14 (< |c_ULTIMATE.start_main1_~x~0#1| 0))) (let ((.cse7 (not .cse14)) (.cse19 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse5 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse8 (not .cse0)) (.cse15 (not .cse21)) (.cse20 (+ .cse24 (- 256)))) (or (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse1 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse6 (+ (- 256) .cse1))) (let ((.cse3 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse6) 256))) (let ((.cse4 (mod .cse6 .cse3)) (.cse2 (mod .cse3 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse1 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse2 256)) (not (= .cse3 0)) (not (= .cse4 0)) (= .cse5 (mod (+ .cse4 (* .cse3 255)) 256)) (= .cse2 0))))))) .cse7) (and .cse8 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse10 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse9 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse10) 256))) (and (not (= .cse9 0)) (<= .cse10 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse10 .cse9) 256)) (= (mod (mod .cse9 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|))))) .cse7) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse12 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse11 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse12) 256))) (let ((.cse13 (mod .cse11 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse11 0)) (<= .cse12 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse12 .cse11) 256)) (= (mod .cse13 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse13 0)))))) .cse8 .cse7) (and .cse14 .cse15 .cse8 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse16 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse18 (+ (- 256) (mod (+ (mod .cse20 .cse16) (* 255 .cse16)) 256)))) (let ((.cse17 (mod .cse18 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse16 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse17 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse16 .cse18) 256)) (= .cse19 (mod (+ .cse17 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) 256)))))))) (and .cse14 .cse21 .cse8 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse22 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse23 (mod (mod .cse24 .cse22) 256))) (and (<= .cse22 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse23 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse23 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse22 .cse23) 256))))))) (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse25 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse28 (+ (- 256) .cse25))) (let ((.cse26 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse28) 256))) (let ((.cse27 (mod .cse28 .cse26))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse25 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse26 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse26 0)) (not (= .cse27 0)) (= .cse5 (mod (+ .cse27 (* .cse26 255)) 256)))))))) .cse7) (and .cse0 .cse14 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse33 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse31 (+ (- 256) .cse33))) (let ((.cse30 (mod (+ (mod .cse20 .cse31) .cse33) 256))) (let ((.cse32 (+ (- 256) .cse30))) (let ((.cse29 (mod .cse32 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse29 0)) (= .cse5 (mod (+ .cse30 (mod .cse31 .cse32)) 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse33 127)) (= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse19)))))))) .cse15) (and .cse14 (or (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse37 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse38 (+ (- 256) .cse37))) (let ((.cse34 (mod (+ (mod .cse20 .cse38) .cse37) 256))) (let ((.cse39 (+ (- 256) .cse34))) (let ((.cse36 (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse35 (mod .cse38 .cse39))) (and (= .cse5 (mod (+ .cse34 .cse35) 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (= .cse36 0) (not (<= .cse37 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse36 256)) (not (= .cse35 0))))))))) .cse15) (and .cse0 .cse21 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse42 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse44 (+ (- 256) .cse42))) (let ((.cse43 (mod (mod .cse24 .cse44) 256))) (let ((.cse40 (mod .cse44 .cse43)) (.cse41 (mod .cse43 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse40 0)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (= 0 .cse41) (not (<= .cse42 127)) (= .cse5 (mod (+ .cse40 (* 255 .cse43)) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse41 256)) (not (= .cse43 0))))))))))) (and .cse0 .cse14 .cse21 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse46 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse48 (+ (- 256) .cse46))) (let ((.cse47 (mod (mod .cse24 .cse48) 256))) (let ((.cse45 (mod .cse48 .cse47))) (and (not (= .cse45 0)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse46 127)) (= .cse5 (mod (+ .cse45 (* 255 .cse47)) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse47 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse47 0))))))))) (and .cse14 .cse8 (or (and .cse21 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse49 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse51 (mod (mod .cse24 .cse49) 256))) (let ((.cse50 (mod .cse51 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse49 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse50 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse51 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse49 .cse51) 256)) (= .cse50 0))))))) (and .cse15 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse52 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse54 (+ (- 256) (mod (+ (mod .cse20 .cse52) (* 255 .cse52)) 256)))) (let ((.cse53 (mod .cse54 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse52 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse53 256)) (= .cse53 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse52 .cse54) 256)))))))))))))) (or (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (< |c_ULTIMATE.start_gcd_test_~a#1| (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-03 01:47:55,862 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse8 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse12 (+ .cse8 (- 256))) (.cse19 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse3 (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (.cse4 (<= .cse8 127)) (.cse13 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|))) (or (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse1 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse0 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse1) 256))) (let ((.cse2 (mod (mod .cse1 .cse0) 256))) (and (not (= .cse0 0)) (<= .cse1 127) (= (mod (mod .cse0 .cse2) 256) 0) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse2 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse2)))))) (not .cse3)) (and .cse3 (or (and .cse4 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse7 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse5 (mod (mod .cse8 .cse7) 256))) (let ((.cse6 (mod (mod .cse7 .cse5) 256))) (and (= (mod .cse5 .cse6) 0) (<= .cse7 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse5 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse6) (not (= .cse6 0)))))))) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse9 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse11 (+ (- 256) (mod (+ (mod .cse12 .cse9) (* 255 .cse9)) 256)))) (let ((.cse10 (mod (mod .cse9 .cse11) 256))) (and (<= .cse9 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse10 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse10) (= (mod (mod .cse11 .cse10) 256) 0)))))) (not .cse4)))) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse15 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse18 (+ (- 256) .cse15))) (let ((.cse16 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse18) 256))) (let ((.cse17 (mod .cse18 .cse16))) (let ((.cse14 (mod (+ .cse17 (* .cse16 255)) 256))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= .cse13 .cse14) (not (<= .cse15 127)) (not (= .cse16 0)) (not (= .cse17 0)) (= (mod (mod .cse16 (+ .cse14 (- 256))) 256) 0)))))))) .cse19) (and .cse3 (or (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse23 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse24 (+ (- 256) .cse23))) (let ((.cse22 (mod (mod .cse8 .cse24) 256))) (let ((.cse21 (mod .cse24 .cse22))) (let ((.cse20 (mod (+ .cse21 (* 255 .cse22)) 256))) (and (<= .cse13 .cse20) (not (= .cse21 0)) (= (mod .cse22 (+ (- 256) .cse20)) 0) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse23 127)) (not (= .cse22 0))))))))) .cse4) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse26 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse30 (+ (- 256) .cse26))) (let ((.cse29 (mod (+ (mod .cse12 .cse30) .cse26) 256))) (let ((.cse27 (+ (- 256) .cse29))) (let ((.cse28 (mod .cse30 .cse27))) (let ((.cse25 (mod (+ .cse29 .cse28) 256))) (and (<= .cse13 .cse25) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse26 127)) (= (mod .cse27 (+ (- 256) .cse25)) 0) (not (= .cse28 0)))))))))) (< 127 .cse8)))) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse32 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse35 (+ (- 256) .cse32))) (let ((.cse33 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse35) 256))) (let ((.cse34 (mod .cse35 .cse33))) (let ((.cse31 (mod (+ .cse34 (* .cse33 255)) 256))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= .cse13 .cse31) (not (<= .cse32 127)) (not (= .cse33 0)) (= (mod .cse33 (+ .cse31 (- 256))) 0) (not (= .cse34 0))))))))) .cse19) (and .cse3 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse36 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse37 (mod (mod .cse8 .cse36) 256))) (let ((.cse38 (mod (mod .cse36 .cse37) 256))) (and (<= .cse36 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse37 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse38) (= (mod (mod .cse37 .cse38) 256) 0) (not (= .cse38 0))))))) .cse4) (and .cse3 .cse4 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse41 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse43 (+ (- 256) .cse41))) (let ((.cse42 (mod (mod .cse8 .cse43) 256))) (let ((.cse40 (mod .cse43 .cse42))) (let ((.cse39 (mod (+ .cse40 (* 255 .cse42)) 256))) (and (<= .cse13 .cse39) (not (= .cse40 0)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse41 127)) (= (mod (mod .cse42 (+ (- 256) .cse39)) 256) 0) (not (= .cse42 0))))))))))))) (or (<= |c_ULTIMATE.start_main1_~g~0#1| |c_ULTIMATE.start_main1_~x~0#1|) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)))) is different from false [2022-11-03 01:47:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:47:55,899 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-11-03 01:47:55,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:47:55,900 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 01:47:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:47:55,901 INFO L225 Difference]: With dead ends: 31 [2022-11-03 01:47:55,901 INFO L226 Difference]: Without dead ends: 27 [2022-11-03 01:47:55,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 299.6s TimeCoverageRelationStatistics Valid=52, Invalid=139, Unknown=15, NotChecked=174, Total=380 [2022-11-03 01:47:55,903 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:47:55,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 65 Unchecked, 0.1s Time] [2022-11-03 01:47:55,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-03 01:47:55,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-03 01:47:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 01:47:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-03 01:47:55,920 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 9 [2022-11-03 01:47:55,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:47:55,921 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-03 01:47:55,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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-03 01:47:55,922 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-03 01:47:55,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:47:55,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:47:55,922 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-11-03 01:47:55,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:47:56,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:56,128 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:47:56,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:47:56,129 INFO L85 PathProgramCache]: Analyzing trace with hash 445311173, now seen corresponding path program 4 times [2022-11-03 01:47:56,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:47:56,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480507439] [2022-11-03 01:47:56,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:56,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:47:56,137 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 01:47:56,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1378924369] [2022-11-03 01:47:56,137 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:47:56,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:56,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:47:56,139 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:47:56,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db96197-ae39-43ca-98c9-c7cca22dedc7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:47:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:56,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 01:47:56,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:48:19,363 WARN L234 SmtUtils]: Spent 18.27s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:48:43,655 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse19 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse12 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse0 (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (.cse16 (<= .cse19 127))) (let ((.cse5 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse6 (+ .cse19 (- 256))) (.cse1 (not .cse16)) (.cse9 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse14 (not .cse0)) (.cse31 (not .cse12))) (or (and (or (and .cse0 .cse1 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse4 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse7 (+ (- 256) .cse4))) (let ((.cse3 (mod .cse7 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse2 (mod .cse6 .cse7))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (= .cse2 0)) (= .cse3 0) (not (<= .cse4 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse3 256)) (= .cse5 (mod (+ .cse2 .cse4) 256)))))))) (and .cse0 .cse1 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse8 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse11 (+ (- 256) .cse8))) (let ((.cse10 (mod .cse11 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse8 127)) (= .cse9 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse10) 256)) (not (= .cse10 0)) (= .cse5 (mod (+ (mod .cse6 .cse11) .cse8) 256))))))))) .cse12) (and .cse12 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_43| Int)) (let ((.cse13 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_43|) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (= .cse5 .cse13) (not (<= .cse13 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_43| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse14) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_43| Int)) (let ((.cse15 (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_43|))) (and (not (= |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (not (= .cse15 0)) (= .cse5 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_43|) .cse15) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_43| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse0 .cse1))) (and (let ((.cse23 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and .cse0 .cse16 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse18 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse20 (+ (- 256) .cse18))) (let ((.cse17 (mod .cse20 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (= .cse17 0) (not (<= .cse18 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse17 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse19 .cse20) 256)))))))) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse21 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse22 (+ (- 256) .cse21))) (let ((.cse24 (mod .cse22 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse21 127)) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse22) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod (+ .cse23 .cse24) 256) .cse9) (not (= .cse24 0))))))) .cse14) (and .cse0 .cse16 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse25 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse26 (+ (- 256) .cse25))) (let ((.cse27 (mod .cse26 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse25 127)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse19 .cse26) 256)) (= (mod (+ .cse23 .cse27) 256) .cse9) (not (= .cse27 0)))))))) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse29 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse30 (+ (- 256) .cse29))) (let ((.cse28 (mod .cse30 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (= .cse28 0) (not (<= .cse29 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse28 256)) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse30) 256) |c_ULTIMATE.start_gcd_test_~a#1|)))))) .cse14))) .cse31) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_43| Int)) (let ((.cse32 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_43|) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (<= .cse32 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_43| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse32 |c_ULTIMATE.start_gcd_test_~a#1|)))) .cse14) (and .cse0 .cse16 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_43| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse19 |v_ULTIMATE.start_gcd_test_~a#1_43|) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_43| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|))))) .cse31))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-03 01:49:18,828 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse31 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse25 (<= .cse31 127)) (.cse16 (< |c_ULTIMATE.start_main1_~x~0#1| 0))) (let ((.cse10 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse6 (not .cse16)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse20 (+ .cse31 (- 256))) (.cse24 (not .cse25))) (or (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse0 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse5 (+ (- 256) .cse0))) (let ((.cse1 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse5) 256))) (let ((.cse2 (mod .cse5 .cse1))) (let ((.cse3 (mod (+ .cse2 (* .cse1 255)) 256))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse0 127)) (not (= .cse1 0)) (not (= .cse2 0)) (= (mod (mod .cse1 (+ .cse3 (- 256))) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse3 .cse4)))))))) .cse6) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_43| Int)) (let ((.cse8 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_43|) 256))) (let ((.cse11 (+ .cse8 (- 256)))) (let ((.cse7 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_43| .cse11) 256))) (let ((.cse9 (mod .cse11 .cse7))) (and (<= .cse7 |c_ULTIMATE.start_gcd_test_~a#1|) (not (<= .cse8 127)) (not (= .cse9 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (not (= .cse7 0)) (= (mod (+ .cse9 (* .cse7 255)) 256) .cse10))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_43| Int)) (let ((.cse13 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_43|) 256))) (let ((.cse15 (+ .cse13 (- 256)))) (let ((.cse12 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_43| .cse15) 256))) (let ((.cse14 (mod .cse15 .cse12))) (and (<= .cse12 |c_ULTIMATE.start_gcd_test_~a#1|) (not (<= .cse13 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (not (= .cse12 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse14 256)) (= .cse14 0)))))))) .cse6) (and .cse16 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_43| Int)) (let ((.cse19 (+ (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_43|) (mod .cse20 |v_ULTIMATE.start_gcd_test_~a#1_43|)) 256) (- 256)))) (let ((.cse18 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_43| .cse19) 256))) (let ((.cse17 (mod .cse19 .cse18))) (and (not (= .cse17 0)) (not (= .cse18 0)) (= .cse10 (mod (+ .cse17 (* .cse18 255)) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (<= .cse18 |c_ULTIMATE.start_gcd_test_~a#1|)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_43| Int)) (let ((.cse23 (+ (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_43|) (mod .cse20 |v_ULTIMATE.start_gcd_test_~a#1_43|)) 256) (- 256)))) (let ((.cse22 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_43| .cse23) 256))) (let ((.cse21 (mod .cse23 .cse22))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse21 256)) (not (= .cse22 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (= .cse21 0) (<= .cse22 |c_ULTIMATE.start_gcd_test_~a#1|))))))) .cse24) (and .cse16 .cse25 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse27 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse30 (+ (- 256) .cse27))) (let ((.cse29 (mod (mod .cse31 .cse30) 256))) (let ((.cse26 (mod .cse30 .cse29))) (let ((.cse28 (mod (+ .cse26 (* 255 .cse29)) 256))) (and (not (= .cse26 0)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse27 127)) (<= .cse28 .cse4) (not (= .cse29 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse29 (+ (- 256) .cse28)) 256)))))))))) (and .cse16 .cse25 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_43| Int)) (let ((.cse32 (mod (mod .cse31 |v_ULTIMATE.start_gcd_test_~a#1_43|) 256))) (let ((.cse33 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_43| .cse32) 256))) (and (not (= .cse32 0)) (not (= .cse33 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse32 .cse33) 256)) (<= .cse33 |c_ULTIMATE.start_gcd_test_~a#1|)))))) (and .cse16 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse34 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse39 (+ (- 256) .cse34))) (let ((.cse38 (mod (+ (mod .cse20 .cse39) .cse34) 256))) (let ((.cse37 (+ (- 256) .cse38))) (let ((.cse36 (mod (+ .cse38 (mod .cse39 .cse37)) 256))) (let ((.cse35 (mod .cse37 (+ (- 256) .cse36)))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse34 127)) (= .cse10 (mod (+ .cse35 .cse36) 256)) (<= .cse36 .cse4) (not (= .cse35 0)))))))))) .cse24) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_43| Int)) (let ((.cse41 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_43|) 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_43| .cse41) 256))) (and (<= .cse40 |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse41 127) (= (mod (mod .cse41 .cse40) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse40 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (not (= .cse41 0)))))) .cse6) (and .cse16 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse44 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse47 (+ (- 256) .cse44))) (let ((.cse46 (mod (mod .cse31 .cse47) 256))) (let ((.cse42 (mod .cse47 .cse46))) (let ((.cse45 (mod (+ .cse42 (* 255 .cse46)) 256))) (let ((.cse43 (mod .cse46 (+ (- 256) .cse45)))) (and (not (= .cse42 0)) (= .cse43 0) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse44 127)) (<= .cse45 .cse4) (not (= .cse46 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse43 256)))))))))) .cse25) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse48 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse53 (+ (- 256) .cse48))) (let ((.cse49 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse53) 256))) (let ((.cse51 (mod .cse53 .cse49))) (let ((.cse52 (mod (+ .cse51 (* .cse49 255)) 256))) (let ((.cse50 (mod .cse49 (+ .cse52 (- 256))))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse48 127)) (not (= .cse49 0)) (= .cse50 0) (not (= .cse51 0)) (= (mod .cse50 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse52 .cse4))))))))) .cse6) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse54 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse60 (+ (- 256) .cse54))) (let ((.cse59 (mod (+ (mod .cse20 .cse60) .cse54) 256))) (let ((.cse58 (+ (- 256) .cse59))) (let ((.cse57 (mod .cse60 .cse58))) (let ((.cse55 (mod (+ .cse59 .cse57) 256))) (let ((.cse56 (mod .cse58 (+ (- 256) .cse55)))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse54 127)) (<= .cse55 .cse4) (= .cse56 0) (not (= .cse57 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse56 256))))))))))) .cse16 .cse24))))) is different from false [2022-11-03 01:49:22,460 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse31 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse25 (<= .cse31 127)) (.cse16 (< |c_ULTIMATE.start_main1_~x~0#1| 0))) (let ((.cse10 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse6 (not .cse16)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse20 (+ .cse31 (- 256))) (.cse24 (not .cse25))) (or (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse0 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse5 (+ (- 256) .cse0))) (let ((.cse1 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse5) 256))) (let ((.cse2 (mod .cse5 .cse1))) (let ((.cse3 (mod (+ .cse2 (* .cse1 255)) 256))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse0 127)) (not (= .cse1 0)) (not (= .cse2 0)) (= (mod (mod .cse1 (+ .cse3 (- 256))) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse3 .cse4)))))))) .cse6) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_43| Int)) (let ((.cse8 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_43|) 256))) (let ((.cse11 (+ .cse8 (- 256)))) (let ((.cse7 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_43| .cse11) 256))) (let ((.cse9 (mod .cse11 .cse7))) (and (<= .cse7 |c_ULTIMATE.start_gcd_test_~a#1|) (not (<= .cse8 127)) (not (= .cse9 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (not (= .cse7 0)) (= (mod (+ .cse9 (* .cse7 255)) 256) .cse10))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_43| Int)) (let ((.cse13 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_43|) 256))) (let ((.cse15 (+ .cse13 (- 256)))) (let ((.cse12 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_43| .cse15) 256))) (let ((.cse14 (mod .cse15 .cse12))) (and (<= .cse12 |c_ULTIMATE.start_gcd_test_~a#1|) (not (<= .cse13 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (not (= .cse12 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse14 256)) (= .cse14 0)))))))) .cse6) (and .cse16 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_43| Int)) (let ((.cse19 (+ (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_43|) (mod .cse20 |v_ULTIMATE.start_gcd_test_~a#1_43|)) 256) (- 256)))) (let ((.cse18 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_43| .cse19) 256))) (let ((.cse17 (mod .cse19 .cse18))) (and (not (= .cse17 0)) (not (= .cse18 0)) (= .cse10 (mod (+ .cse17 (* .cse18 255)) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (<= .cse18 |c_ULTIMATE.start_gcd_test_~a#1|)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_43| Int)) (let ((.cse23 (+ (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_43|) (mod .cse20 |v_ULTIMATE.start_gcd_test_~a#1_43|)) 256) (- 256)))) (let ((.cse22 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_43| .cse23) 256))) (let ((.cse21 (mod .cse23 .cse22))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse21 256)) (not (= .cse22 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (= .cse21 0) (<= .cse22 |c_ULTIMATE.start_gcd_test_~a#1|))))))) .cse24) (and .cse16 .cse25 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse27 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse30 (+ (- 256) .cse27))) (let ((.cse29 (mod (mod .cse31 .cse30) 256))) (let ((.cse26 (mod .cse30 .cse29))) (let ((.cse28 (mod (+ .cse26 (* 255 .cse29)) 256))) (and (not (= .cse26 0)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse27 127)) (<= .cse28 .cse4) (not (= .cse29 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse29 (+ (- 256) .cse28)) 256)))))))))) (and .cse16 .cse25 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_43| Int)) (let ((.cse32 (mod (mod .cse31 |v_ULTIMATE.start_gcd_test_~a#1_43|) 256))) (let ((.cse33 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_43| .cse32) 256))) (and (not (= .cse32 0)) (not (= .cse33 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse32 .cse33) 256)) (<= .cse33 |c_ULTIMATE.start_gcd_test_~a#1|)))))) (and .cse16 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse34 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse39 (+ (- 256) .cse34))) (let ((.cse38 (mod (+ (mod .cse20 .cse39) .cse34) 256))) (let ((.cse37 (+ (- 256) .cse38))) (let ((.cse36 (mod (+ .cse38 (mod .cse39 .cse37)) 256))) (let ((.cse35 (mod .cse37 (+ (- 256) .cse36)))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse34 127)) (= .cse10 (mod (+ .cse35 .cse36) 256)) (<= .cse36 .cse4) (not (= .cse35 0)))))))))) .cse24) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_43| Int)) (let ((.cse41 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_43|) 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_43| .cse41) 256))) (and (<= .cse40 |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse41 127) (= (mod (mod .cse41 .cse40) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse40 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_43| 0)) (not (= .cse41 0)))))) .cse6) (and .cse16 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse44 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse47 (+ (- 256) .cse44))) (let ((.cse46 (mod (mod .cse31 .cse47) 256))) (let ((.cse42 (mod .cse47 .cse46))) (let ((.cse45 (mod (+ .cse42 (* 255 .cse46)) 256))) (let ((.cse43 (mod .cse46 (+ (- 256) .cse45)))) (and (not (= .cse42 0)) (= .cse43 0) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse44 127)) (<= .cse45 .cse4) (not (= .cse46 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse43 256)))))))))) .cse25) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse48 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse53 (+ (- 256) .cse48))) (let ((.cse49 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse53) 256))) (let ((.cse51 (mod .cse53 .cse49))) (let ((.cse52 (mod (+ .cse51 (* .cse49 255)) 256))) (let ((.cse50 (mod .cse49 (+ .cse52 (- 256))))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse48 127)) (not (= .cse49 0)) (= .cse50 0) (not (= .cse51 0)) (= (mod .cse50 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse52 .cse4))))))))) .cse6) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse54 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse60 (+ (- 256) .cse54))) (let ((.cse59 (mod (+ (mod .cse20 .cse60) .cse54) 256))) (let ((.cse58 (+ (- 256) .cse59))) (let ((.cse57 (mod .cse60 .cse58))) (let ((.cse55 (mod (+ .cse59 .cse57) 256))) (let ((.cse56 (mod .cse58 (+ (- 256) .cse55)))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (not (<= .cse54 127)) (<= .cse55 .cse4) (= .cse56 0) (not (= .cse57 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse56 256))))))))))) .cse16 .cse24))))) is different from true [2022-11-03 01:50:17,695 WARN L234 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:50:29,988 WARN L234 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:50:37,688 WARN L234 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:50:51,629 WARN L234 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:51:01,699 WARN L234 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 17 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:51:09,768 WARN L234 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:51:30,687 WARN L234 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:51:36,806 WARN L234 SmtUtils]: Spent 5.95s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:51:42,927 WARN L234 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:51:48,423 WARN L234 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:51:53,844 WARN L234 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:51:59,336 WARN L234 SmtUtils]: Spent 5.49s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)