./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --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 edf451b08ccf28b9358a6fa7c10128ea1b9a8f09b01361f9cd588dc4a31f271a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:49:18,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:49:18,407 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 00:49:18,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:49:18,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:49:18,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:49:18,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:49:18,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:49:18,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:49:18,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:49:18,469 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:49:18,470 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:49:18,471 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:49:18,473 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:49:18,473 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:49:18,474 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:49:18,474 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:49:18,475 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:49:18,475 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:49:18,476 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:49:18,477 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:49:18,477 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:49:18,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:49:18,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:49:18,480 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:49:18,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:49:18,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:49:18,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:49:18,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:49:18,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:49:18,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:49:18,484 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:49:18,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:49:18,485 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:49:18,485 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:49:18,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:49:18,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:49:18,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:49:18,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:49:18,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:49:18,487 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:49:18,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:49:18,488 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:49:18,489 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:49:18,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:49:18,490 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/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_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> edf451b08ccf28b9358a6fa7c10128ea1b9a8f09b01361f9cd588dc4a31f271a [2023-11-12 00:49:18,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:49:18,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:49:18,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:49:18,859 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:49:18,859 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:49:18,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i [2023-11-12 00:49:21,966 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:49:22,223 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:49:22,223 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i [2023-11-12 00:49:22,235 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/data/1fcaca3c8/414fced500b2480980019cbb564df2dd/FLAG9ae5bacb7 [2023-11-12 00:49:22,255 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/data/1fcaca3c8/414fced500b2480980019cbb564df2dd [2023-11-12 00:49:22,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:49:22,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:49:22,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:49:22,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:49:22,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:49:22,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:49:22" (1/1) ... [2023-11-12 00:49:22,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f1cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:22, skipping insertion in model container [2023-11-12 00:49:22,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:49:22" (1/1) ... [2023-11-12 00:49:22,316 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:49:22,501 WARN L240 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_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[1226,1239] [2023-11-12 00:49:22,531 WARN L240 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_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[2841,2854] [2023-11-12 00:49:22,532 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:49:22,544 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:49:22,559 WARN L240 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_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[1226,1239] [2023-11-12 00:49:22,573 WARN L240 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_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[2841,2854] [2023-11-12 00:49:22,575 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:49:22,591 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:49:22,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:22 WrapperNode [2023-11-12 00:49:22,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:49:22,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:49:22,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:49:22,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:49:22,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:22" (1/1) ... [2023-11-12 00:49:22,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:22" (1/1) ... [2023-11-12 00:49:22,669 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 88 [2023-11-12 00:49:22,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:49:22,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:49:22,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:49:22,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:49:22,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:22" (1/1) ... [2023-11-12 00:49:22,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:22" (1/1) ... [2023-11-12 00:49:22,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:22" (1/1) ... [2023-11-12 00:49:22,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:22" (1/1) ... [2023-11-12 00:49:22,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:22" (1/1) ... [2023-11-12 00:49:22,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:22" (1/1) ... [2023-11-12 00:49:22,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:22" (1/1) ... [2023-11-12 00:49:22,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:22" (1/1) ... [2023-11-12 00:49:22,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:49:22,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:49:22,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:49:22,732 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:49:22,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:22" (1/1) ... [2023-11-12 00:49:22,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:49:22,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:49:22,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:49:22,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:49:22,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:49:22,833 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-12 00:49:22,834 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-12 00:49:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-12 00:49:22,836 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-12 00:49:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:49:22,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:49:22,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:49:22,933 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:49:22,935 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:49:23,149 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:49:23,221 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:49:23,221 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 00:49:23,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:49:23 BoogieIcfgContainer [2023-11-12 00:49:23,226 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:49:23,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:49:23,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:49:23,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:49:23,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:49:22" (1/3) ... [2023-11-12 00:49:23,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca43b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:49:23, skipping insertion in model container [2023-11-12 00:49:23,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:22" (2/3) ... [2023-11-12 00:49:23,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca43b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:49:23, skipping insertion in model container [2023-11-12 00:49:23,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:49:23" (3/3) ... [2023-11-12 00:49:23,250 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_2.i [2023-11-12 00:49:23,272 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:49:23,272 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-12 00:49:23,324 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:49:23,331 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=LoopHeads, 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;@1d00debd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:49:23,332 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-12 00:49:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-12 00:49:23,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:49:23,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:49:23,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:49:23,346 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:49:23,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:49:23,352 INFO L85 PathProgramCache]: Analyzing trace with hash -499021812, now seen corresponding path program 1 times [2023-11-12 00:49:23,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:49:23,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414966606] [2023-11-12 00:49:23,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:49:23,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:49:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:49:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:49:23,840 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:49:23,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414966606] [2023-11-12 00:49:23,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414966606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:49:23,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:49:23,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:49:23,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051434081] [2023-11-12 00:49:23,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:49:23,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:49:23,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:49:23,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:49:23,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:49:23,882 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:49:23,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:49:23,985 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2023-11-12 00:49:23,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:49:23,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-12 00:49:23,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:49:23,995 INFO L225 Difference]: With dead ends: 36 [2023-11-12 00:49:23,995 INFO L226 Difference]: Without dead ends: 21 [2023-11-12 00:49:23,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:49:24,004 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:49:24,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 35 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:49:24,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-12 00:49:24,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-12 00:49:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-12 00:49:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2023-11-12 00:49:24,054 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2023-11-12 00:49:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:49:24,055 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2023-11-12 00:49:24,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:49:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2023-11-12 00:49:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:49:24,057 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:49:24,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:49:24,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:49:24,058 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:49:24,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:49:24,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1643785969, now seen corresponding path program 1 times [2023-11-12 00:49:24,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:49:24,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082466258] [2023-11-12 00:49:24,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:49:24,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:49:24,099 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-12 00:49:24,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [544187648] [2023-11-12 00:49:24,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:49:24,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:49:24,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:49:24,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:49:24,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:49:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:49:24,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-12 00:49:24,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:49:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:49:24,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:49:24,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:49:24,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:49:24,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082466258] [2023-11-12 00:49:24,951 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-12 00:49:24,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544187648] [2023-11-12 00:49:24,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544187648] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:49:24,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1955844392] [2023-11-12 00:49:24,991 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-11-12 00:49:24,992 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:49:24,996 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:49:25,006 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:49:25,007 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:49:28,260 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:49:28,602 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '151#(and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main1_~x~0#1| 127) (<= (+ |ULTIMATE.start_main1_~y~0#1| 1) |ULTIMATE.start_main1_~g~0#1|) (<= 1 |ULTIMATE.start_main1_~y~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 (+ |ULTIMATE.start_main1_~x~0#1| 128)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))' at error location [2023-11-12 00:49:28,602 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:49:28,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:49:28,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-12 00:49:28,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814137659] [2023-11-12 00:49:28,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:49:28,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 00:49:28,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:49:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 00:49:28,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-12 00:49:28,606 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:49:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:49:28,759 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2023-11-12 00:49:28,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:49:28,760 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-12 00:49:28,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:49:28,761 INFO L225 Difference]: With dead ends: 28 [2023-11-12 00:49:28,761 INFO L226 Difference]: Without dead ends: 23 [2023-11-12 00:49:28,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-11-12 00:49:28,763 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:49:28,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 83 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:49:28,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-12 00:49:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-12 00:49:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-12 00:49:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-11-12 00:49:28,771 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 7 [2023-11-12 00:49:28,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:49:28,772 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-11-12 00:49:28,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:49:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-11-12 00:49:28,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:49:28,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:49:28,773 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2023-11-12 00:49:28,790 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-12 00:49:28,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:49:28,979 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:49:28,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:49:28,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1300293201, now seen corresponding path program 2 times [2023-11-12 00:49:28,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:49:28,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019025643] [2023-11-12 00:49:28,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:49:28,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:49:28,992 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-12 00:49:28,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [618385197] [2023-11-12 00:49:28,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:49:28,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:49:28,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:49:28,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:49:29,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6ef5127-2f83-4b86-b0e5-8065d0eb91d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:49:29,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-12 00:49:29,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:49:29,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-12 00:49:29,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:50:08,302 WARN L854 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (let ((.cse4 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse6 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (exists ((v_z_4 Int)) (and (exists ((v_y_4 Int)) (let ((.cse0 (+ (* 256 v_y_4) (* 255 v_z_4)))) (and (<= 0 .cse0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse0) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= .cse0 (mod .cse1 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse1) 256) 127))))))) (<= v_z_4 255) (<= 128 v_z_4))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (exists ((v_z_4 Int)) (and (exists ((v_y_4 Int)) (let ((.cse2 (+ (* 256 v_y_4) (* 255 v_z_4)))) (and (<= 0 .cse2) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse2) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= .cse2 (mod .cse3 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse3) 256)))))))) (<= v_z_4 255) (<= 128 v_z_4)))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse5 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse6 .cse5) 256))) 256)) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse5) 256) 127)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (mod .cse7 256)) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse7) 256))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (mod .cse9 256)))) (let ((.cse8 (mod .cse10 256))) (and (<= .cse8 127) (= .cse8 |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= 128 (mod (+ (* 255 .cse9) .cse10) 256)) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse9) 256) 127)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|))) (and (or (exists ((v_y_6 Int) (|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse11 (* 256 v_y_6)) (.cse12 (mod (+ .cse6 .cse13) 256))) (and (<= (+ 384 .cse11) .cse12) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (<= .cse12 (+ 511 .cse11)) (not (= .cse13 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) .cse12)) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse13) 256) 127))))) (exists ((v_y_6 Int) (|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse14 (* 256 v_y_6)) (.cse15 (mod (+ .cse6 .cse16) 256))) (and (<= (+ 384 .cse14) .cse15) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (<= .cse15 (+ 511 .cse14)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse16) 256)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) .cse15)) 0)))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse17) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse6 .cse17) 256))) 256))))))))) (and (let ((.cse18 (mod .cse6 256))) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse18))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= .cse18 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse19 |c_ULTIMATE.start_main1_~y~0#1|) 256))) 256) |c_ULTIMATE.start_gcd_test_~b#1|))) (not (= .cse19 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= (mod (+ .cse19 .cse6) 256) 127)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse18))) (and (<= 128 (mod (* .cse20 255) 256)) (<= .cse18 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (mod .cse20 256)) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ .cse20 .cse6) 256) 127)))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse18))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (<= (mod (+ .cse21 |c_ULTIMATE.start_main1_~y~0#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse21 |c_ULTIMATE.start_main1_~y~0#1|) 256)))) 256) 127)) (<= 128 (mod (+ .cse21 .cse6) 256))))) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse18))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= .cse18 |v_ULTIMATE.start_gcd_test_~a#1_33|) (<= 128 (mod (+ .cse22 .cse6) 256)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse22 |c_ULTIMATE.start_main1_~y~0#1|) 256))) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse18))) (let ((.cse23 (mod .cse24 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse23) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse18 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (not (= .cse23 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ .cse24 .cse6) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse18))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (mod .cse25 256)) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse18 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (<= 128 (mod (+ .cse25 .cse6) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|)))) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse18))) (and (<= .cse18 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (mod .cse26 256)) 0) (<= 128 (mod (+ .cse26 .cse6) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse18))) (and (not (= .cse27 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= .cse18 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse27 |c_ULTIMATE.start_main1_~y~0#1|) 256))) 0) (<= (mod (+ .cse27 .cse6) 256) 127)))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse18))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= .cse18 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse28 |c_ULTIMATE.start_main1_~y~0#1|) 256))) 256) |c_ULTIMATE.start_gcd_test_~b#1|))) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= 128 (mod (+ .cse28 .cse6) 256)))))) (not (= .cse18 0)) (<= .cse18 127)) (and (let ((.cse34 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse31 (+ .cse18 (- 256)))) (or (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse31))) (let ((.cse29 (mod .cse30 256))) (and (<= .cse18 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (not (= .cse29 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse29) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse30) 256) 127)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse31))) (let ((.cse35 (mod .cse33 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse35))) (and (<= .cse18 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (= (mod (+ .cse32 (* 255 .cse33)) 256) .cse34) (not (= .cse32 0))))) (not (= .cse35 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse33) 256) 127))))) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse31))) (let ((.cse36 (mod .cse37 256))) (and (<= .cse18 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (not (= .cse36 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse37) 256)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse36) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|)))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= .cse18 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (exists ((v_y_1 Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse31))) (let ((.cse39 (* 256 v_y_1)) (.cse38 (mod (+ .cse6 .cse40) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= .cse38 (+ .cse39 511)) (<= (+ .cse39 384) .cse38) (not (= .cse40 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ .cse38 (- 256))) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse40) 256) 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((v_y_1 Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse31))) (let ((.cse42 (* 256 v_y_1)) (.cse41 (mod (+ .cse6 .cse43) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= .cse41 (+ .cse42 511)) (<= (+ .cse42 384) .cse41) (not (= .cse43 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse43) 256)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ .cse41 (- 256))) 0))))) (<= .cse18 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse31))) (let ((.cse46 (mod .cse45 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse46))) (and (<= .cse18 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (= (mod (+ .cse44 (* 255 .cse45)) 256) .cse34) (not (= .cse44 0))))) (not (= .cse46 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse45) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse31))) (let ((.cse47 (mod .cse48 256))) (and (not (= .cse47 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse47) 256)))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse48) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= .cse18 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse31))) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (mod (+ .cse6 .cse50) 256) (- 256))))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse49 0)) (not (= .cse50 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse50) 256)) (= (mod (+ .cse6 .cse49 .cse50) 256) .cse34))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse31))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse51 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse51) 256)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (mod (+ .cse6 .cse51) 256) (- 256))) 256) |c_ULTIMATE.start_gcd_test_~b#1|)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= .cse18 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse31))) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (mod (+ .cse6 .cse53) 256) (- 256))))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse52 0)) (not (= .cse53 0)) (= (mod (+ .cse6 .cse52 .cse53) 256) .cse34) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse53) 256) 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse31))) (let ((.cse54 (mod .cse55 256))) (and (not (= .cse54 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse54) 256)))) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse55) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse31))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse56 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (mod (+ .cse6 .cse56) 256) (- 256))) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse56) 256) 127)))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|))))) (<= 128 .cse18)))) (<= (+ |c_ULTIMATE.start_main1_~y~0#1| 1) 0))))) is different from false [2023-11-12 00:50:16,916 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse3 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (mod .cse1 256)))) (let ((.cse0 (mod .cse2 256))) (and (<= .cse0 127) (= .cse0 |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= 128 (mod (+ (* 255 .cse1) .cse2) 256)) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse1) 256) 127)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse3 .cse4) 256))) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse4) 256))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse3 .cse5) 256))) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse5 0)) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse5) 256) 127)))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (mod .cse6 256)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse6) 256))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|)))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|)) (and (let ((.cse8 (mod .cse3 256))) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse8))) (let ((.cse7 (mod .cse9 256))) (and (not (= .cse7 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse7) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse8 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ .cse9 .cse3) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse8))) (and (not (= .cse10 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse10 |c_ULTIMATE.start_main1_~y~0#1|) 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse8 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (<= (mod (+ .cse10 .cse3) 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse8))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (mod .cse11 256)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse8 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (<= 128 (mod (+ .cse11 .cse3) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse8))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= 128 (mod (+ .cse12 .cse3) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse12 |c_ULTIMATE.start_main1_~y~0#1|) 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse8 |v_ULTIMATE.start_gcd_test_~a#1_33|))))))) (not (= .cse8 0)) (<= .cse8 127)) (and (let ((.cse15 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse16 (+ .cse8 (- 256)))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= .cse8 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse16))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (mod (+ .cse3 .cse14) 256) (- 256))))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse13 0)) (= (mod (+ .cse3 .cse13 .cse14) 256) .cse15) (not (= .cse14 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse14) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse16))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse17 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (mod (+ .cse3 .cse17) 256) (- 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse17) 256) 127)))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse16))) (let ((.cse18 (mod .cse20 256))) (and (not (= .cse18 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse18))) (and (<= .cse8 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (not (= .cse19 0)) (= .cse15 (mod (+ .cse19 (* 255 .cse20)) 256))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse20) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse16))) (let ((.cse21 (mod .cse22 256))) (and (not (= .cse21 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse22) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse21) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse16))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse23 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse23) 256)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (mod (+ .cse3 .cse23) 256) (- 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|)))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= .cse8 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse16))) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (mod (+ .cse3 .cse25) 256) (- 256))))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse24 0)) (= (mod (+ .cse3 .cse24 .cse25) 256) .cse15) (not (= .cse25 0)) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse25) 256) 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse16))) (let ((.cse26 (mod .cse28 256))) (and (not (= .cse26 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse26))) (and (<= .cse8 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (not (= .cse27 0)) (= .cse15 (mod (+ .cse27 (* 255 .cse28)) 256))))) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse28) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse16))) (let ((.cse29 (mod .cse30 256))) (and (not (= .cse29 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse29) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse30) 256) 127))))))) (<= 128 .cse8)))) (<= (+ |c_ULTIMATE.start_main1_~y~0#1| 1) 0)))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse36 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (let ((.cse37 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse38 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (<= .cse44 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse44)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse45 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_34|) (<= 128 .cse45) (= .cse45 .cse36)))))) (.cse39 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0))) (or (and (let ((.cse33 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse32 (mod (+ .cse33 .cse31) 256))) (and (not (= .cse31 0)) (<= .cse32 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse32))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse35 (mod (+ .cse33 .cse34) 256))) (and (not (= .cse34 0)) (<= 128 .cse35) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0) (= .cse35 .cse36))))))) .cse37) (and .cse37 .cse38) (and .cse39 .cse38) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse40) 256))) (and (not (= .cse40 0)) (<= 128 .cse41) (= .cse41 .cse36) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse42) 256))) (and (not (= .cse42 0)) (<= .cse43 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0) (= .cse43 |c_ULTIMATE.start_gcd_test_~b#1|)))))) .cse39) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|) 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)))))) is different from false