./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_7.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E --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 5f340d35cff17443f161c05142ff32471e0b069a47814c4e28ff520efea1035b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:40:55,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:40:56,029 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 05:40:56,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:40:56,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:40:56,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:40:56,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:40:56,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:40:56,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:40:56,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:40:56,072 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:40:56,072 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:40:56,072 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:40:56,073 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:40:56,073 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:40:56,073 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:40:56,073 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:40:56,073 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:40:56,073 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:40:56,074 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:40:56,074 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:40:56,074 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:40:56,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:40:56,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:40:56,074 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:40:56,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:40:56,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:40:56,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:40:56,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:40:56,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:40:56,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:40:56,076 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:40:56,076 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:40:56,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:40:56,076 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:40:56,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:40:56,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:40:56,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:40:56,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:40:56,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:40:56,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:40:56,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:40:56,078 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:40:56,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:40:56,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:40:56,078 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:40:56,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:40:56,079 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E 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 -> 5f340d35cff17443f161c05142ff32471e0b069a47814c4e28ff520efea1035b [2024-11-14 05:40:56,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:40:56,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:40:56,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:40:56,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:40:56,495 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:40:56,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/combinations/gcd_2+newton_2_7.i Unable to find full path for "g++" [2024-11-14 05:40:58,952 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:40:59,305 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:40:59,309 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/sv-benchmarks/c/combinations/gcd_2+newton_2_7.i [2024-11-14 05:40:59,317 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/data/524b9171b/29ab18a85609439299d10424057679c9/FLAG422374037 [2024-11-14 05:40:59,570 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/data/524b9171b/29ab18a85609439299d10424057679c9 [2024-11-14 05:40:59,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:40:59,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:40:59,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:40:59,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:40:59,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:40:59,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:40:59" (1/1) ... [2024-11-14 05:40:59,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b083660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:40:59, skipping insertion in model container [2024-11-14 05:40:59,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:40:59" (1/1) ... [2024-11-14 05:40:59,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:40:59,845 WARN L250 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_9c0b52cd-c738-4eab-b944-193b9275866a/sv-benchmarks/c/combinations/gcd_2+newton_2_7.i[1226,1239] [2024-11-14 05:40:59,908 WARN L250 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_9c0b52cd-c738-4eab-b944-193b9275866a/sv-benchmarks/c/combinations/gcd_2+newton_2_7.i[2841,2854] [2024-11-14 05:40:59,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:40:59,930 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:40:59,952 WARN L250 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_9c0b52cd-c738-4eab-b944-193b9275866a/sv-benchmarks/c/combinations/gcd_2+newton_2_7.i[1226,1239] [2024-11-14 05:40:59,981 WARN L250 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_9c0b52cd-c738-4eab-b944-193b9275866a/sv-benchmarks/c/combinations/gcd_2+newton_2_7.i[2841,2854] [2024-11-14 05:40:59,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:41:00,017 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:41:00,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:00 WrapperNode [2024-11-14 05:41:00,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:41:00,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:41:00,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:41:00,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:41:00,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:00" (1/1) ... [2024-11-14 05:41:00,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:00" (1/1) ... [2024-11-14 05:41:00,077 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2024-11-14 05:41:00,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:41:00,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:41:00,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:41:00,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:41:00,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:00" (1/1) ... [2024-11-14 05:41:00,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:00" (1/1) ... [2024-11-14 05:41:00,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:00" (1/1) ... [2024-11-14 05:41:00,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:00" (1/1) ... [2024-11-14 05:41:00,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:00" (1/1) ... [2024-11-14 05:41:00,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:00" (1/1) ... [2024-11-14 05:41:00,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:00" (1/1) ... [2024-11-14 05:41:00,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:00" (1/1) ... [2024-11-14 05:41:00,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:41:00,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:41:00,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:41:00,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:41:00,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:00" (1/1) ... [2024-11-14 05:41:00,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:41:00,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:00,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:41:00,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:41:00,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:41:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-14 05:41:00,237 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-14 05:41:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-14 05:41:00,238 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-14 05:41:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:41:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:41:00,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:41:00,353 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:41:00,356 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:41:00,626 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-14 05:41:00,626 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:41:00,728 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:41:00,729 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 05:41:00,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:41:00 BoogieIcfgContainer [2024-11-14 05:41:00,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:41:00,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:41:00,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:41:00,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:41:00,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:40:59" (1/3) ... [2024-11-14 05:41:00,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e2c378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:41:00, skipping insertion in model container [2024-11-14 05:41:00,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:00" (2/3) ... [2024-11-14 05:41:00,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e2c378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:41:00, skipping insertion in model container [2024-11-14 05:41:00,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:41:00" (3/3) ... [2024-11-14 05:41:00,743 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_7.i [2024-11-14 05:41:00,765 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:41:00,767 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_2+newton_2_7.i that has 3 procedures, 25 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2024-11-14 05:41:00,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:41:00,854 INFO L333 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, 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;@481c28d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:41:00,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-14 05:41:00,860 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) [2024-11-14 05:41:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 05:41:00,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:00,869 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 05:41:00,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:41:00,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:00,879 INFO L85 PathProgramCache]: Analyzing trace with hash -614492721, now seen corresponding path program 1 times [2024-11-14 05:41:00,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:00,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425331356] [2024-11-14 05:41:00,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:00,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:01,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:01,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425331356] [2024-11-14 05:41:01,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425331356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:41:01,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:41:01,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:41:01,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577857557] [2024-11-14 05:41:01,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:41:01,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:41:01,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:01,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:41:01,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:41:01,458 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) [2024-11-14 05:41:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:01,612 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-14 05:41:01,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:41:01,617 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 [2024-11-14 05:41:01,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:01,623 INFO L225 Difference]: With dead ends: 35 [2024-11-14 05:41:01,624 INFO L226 Difference]: Without dead ends: 21 [2024-11-14 05:41:01,627 INFO L431 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 [2024-11-14 05:41:01,631 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:01,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:41:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-14 05:41:01,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-14 05:41:01,669 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) [2024-11-14 05:41:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-11-14 05:41:01,675 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2024-11-14 05:41:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:01,676 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-14 05:41:01,676 INFO L472 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) [2024-11-14 05:41:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-11-14 05:41:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 05:41:01,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:01,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:01,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:41:01,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:41:01,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:01,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1935812211, now seen corresponding path program 1 times [2024-11-14 05:41:01,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:01,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713177656] [2024-11-14 05:41:01,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:01,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:02,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:02,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713177656] [2024-11-14 05:41:02,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713177656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:02,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286260418] [2024-11-14 05:41:02,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:02,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:02,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:02,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:02,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:41:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:02,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:41:02,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:02,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:03,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286260418] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:41:03,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1107032731] [2024-11-14 05:41:03,178 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2024-11-14 05:41:03,178 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:41:03,182 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:41:03,188 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:41:03,188 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:41:06,067 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:41:06,462 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '159#(<= 1 |#StackHeapBarrier|)' at error location [2024-11-14 05:41:06,463 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:41:06,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:41:06,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-14 05:41:06,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445647406] [2024-11-14 05:41:06,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:41:06,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 05:41:06,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:41:06,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 05:41:06,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-11-14 05:41:06,468 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) [2024-11-14 05:41:06,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:06,735 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-14 05:41:06,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:41:06,738 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 [2024-11-14 05:41:06,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:06,740 INFO L225 Difference]: With dead ends: 29 [2024-11-14 05:41:06,740 INFO L226 Difference]: Without dead ends: 24 [2024-11-14 05:41:06,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:41:06,743 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:06,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:41:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-14 05:41:06,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-14 05:41:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 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) [2024-11-14 05:41:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-11-14 05:41:06,758 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 7 [2024-11-14 05:41:06,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:06,758 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-14 05:41:06,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) [2024-11-14 05:41:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-11-14 05:41:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:41:06,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:06,761 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:06,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:41:06,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:06,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:41:06,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:06,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1521587535, now seen corresponding path program 2 times [2024-11-14 05:41:06,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:06,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751996170] [2024-11-14 05:41:06,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:06,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:41:09,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:41:09,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751996170] [2024-11-14 05:41:09,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751996170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:09,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930727613] [2024-11-14 05:41:09,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:41:09,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:09,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:09,496 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:09,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:41:09,649 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:41:09,649 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:41:09,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 05:41:09,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:41,334 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse26 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse11 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse12 (mod .cse26 256))) (let ((.cse19 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse29 (<= 128 .cse12)) (.cse30 (<= .cse11 127)) (.cse6 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse2 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse31 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) (or (and (let ((.cse22 (mod .cse2 256))) (or (and (let ((.cse0 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse1 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse3 (+ .cse22 (- 256)))) (or (and .cse0 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse3))) (let ((.cse4 (+ (- 256) (mod (+ .cse2 .cse5) 256)))) (let ((.cse7 (mod .cse4 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse1 (mod (+ .cse2 (mod .cse3 .cse4) .cse5) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse5) 256)) (= .cse6 (mod (+ .cse7 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse7 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse3))) (let ((.cse8 (+ (- 256) (mod (+ .cse2 .cse9) 256)))) (let ((.cse10 (mod .cse8 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse1 (mod (+ .cse2 (mod .cse3 .cse8) .cse9) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse9) 256) 127) (= .cse6 (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse10 0))))))) (and (<= 128 .cse11) (<= .cse12 127) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse3))) (let ((.cse15 (+ (- 256) (mod (+ .cse2 .cse14) 256)))) (let ((.cse13 (mod .cse3 .cse15))) (and (= .cse1 (mod (+ .cse2 .cse13 .cse14) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod .cse15 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse13 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse14) 256))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse3))) (let ((.cse18 (+ (- 256) (mod (+ .cse2 .cse17) 256)))) (let ((.cse16 (mod .cse3 .cse18))) (and (= .cse1 (mod (+ .cse2 .cse16 .cse17) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse17) 256) 127) (= (mod .cse18 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse16 0)))))))) .cse19))) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse3))) (let ((.cse20 (mod .cse3 .cse21))) (and (not (= .cse20 0)) (not (= .cse21 0)) (= (mod .cse21 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= .cse1 (mod (+ .cse20 (* 255 .cse21)) 256))))))))) (<= 128 .cse22)) (and (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (let ((.cse23 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse25) 256)))) (let ((.cse24 (mod .cse23 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod .cse22 .cse23) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse24 0)) (<= (+ .cse22 .cse25) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod (+ .cse26 .cse24) 256) .cse6)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (let ((.cse27 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse28) 256)))) (and (= (mod .cse22 .cse27) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (+ .cse22 .cse28) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod .cse27 |c_ULTIMATE.start_gcd_test_~a#1|) 0))))) .cse19 .cse29 .cse30)) .cse31) (and .cse31 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse22 .cse32)) (<= 128 (+ .cse22 .cse32)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod .cse32 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (and (= (mod .cse33 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse22 .cse33)) (<= 128 (+ .cse22 .cse33)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|)))) .cse19 .cse29 .cse30))) (and (or (and .cse19 .cse29 .cse30 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (let ((.cse34 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse35) 256)))) (and (= (mod .cse22 .cse34) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (+ .cse22 .cse35)) (= (mod .cse34 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (let ((.cse36 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse38) 256)))) (let ((.cse37 (mod .cse36 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod .cse22 .cse36) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse37 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (+ .cse22 .cse38)) (= (mod (+ .cse26 .cse37) 256) .cse6))))))) .cse31) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse22 .cse39)) (<= (+ .cse22 .cse39) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (not (= .cse39 0)) (= (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|)))) (and .cse19 .cse29 .cse30 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (and (= (mod .cse40 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse22 .cse40)) (<= (+ .cse22 .cse40) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (not (= .cse40 0))))))) .cse31)) (not (= .cse22 0)) (<= .cse22 127)))) (<= (+ |c_ULTIMATE.start_main1_~y~0#1| 1) 0)) (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse43 (+ (- 256) (mod (+ .cse2 .cse41) 256)))) (let ((.cse42 (mod .cse43 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (+ |c_ULTIMATE.start_main1_~y~0#1| .cse41) 127) (= (mod (+ .cse26 .cse42) 256) .cse6) (not (= .cse42 0)) (= (mod |c_ULTIMATE.start_main1_~y~0#1| .cse43) |c_ULTIMATE.start_gcd_test_~a#1|)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= (+ |c_ULTIMATE.start_main1_~y~0#1| .cse44) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse44 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |c_ULTIMATE.start_main1_~y~0#1| .cse44)) (not (= .cse44 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse45 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 128 (+ |c_ULTIMATE.start_main1_~y~0#1| .cse45)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |c_ULTIMATE.start_main1_~y~0#1| .cse45))))) (and .cse19 .cse29 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse46 (+ (- 256) (mod (+ .cse2 .cse47) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod .cse46 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 128 (+ |c_ULTIMATE.start_main1_~y~0#1| .cse47)) (= (mod |c_ULTIMATE.start_main1_~y~0#1| .cse46) |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= (mod .cse48 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= (+ |c_ULTIMATE.start_main1_~y~0#1| .cse48) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |c_ULTIMATE.start_main1_~y~0#1| .cse48)) (not (= .cse48 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse50 (+ (- 256) (mod (+ .cse2 .cse49) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (+ |c_ULTIMATE.start_main1_~y~0#1| .cse49) 127) (= (mod .cse50 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod |c_ULTIMATE.start_main1_~y~0#1| .cse50) |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= (mod .cse51 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 128 (+ |c_ULTIMATE.start_main1_~y~0#1| .cse51)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |c_ULTIMATE.start_main1_~y~0#1| .cse51)))))) .cse30) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse54 (+ (- 256) (mod (+ .cse2 .cse53) 256)))) (let ((.cse52 (mod .cse54 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod (+ .cse26 .cse52) 256) .cse6) (not (= .cse52 0)) (<= 128 (+ |c_ULTIMATE.start_main1_~y~0#1| .cse53)) (= (mod |c_ULTIMATE.start_main1_~y~0#1| .cse54) |c_ULTIMATE.start_gcd_test_~a#1|))))))) .cse31 (<= 0 |c_ULTIMATE.start_main1_~y~0#1|)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2024-11-14 05:42:08,562 WARN L851 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse7 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse15 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse0 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse10 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (or (and .cse0 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse2 (mod |c_ULTIMATE.start_main1_~y~0#1| .cse1))) (and (<= (+ |c_ULTIMATE.start_main1_~y~0#1| .cse1) 127) (= (mod .cse1 .cse2) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse2 0)) (= (mod .cse2 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse4 (mod |c_ULTIMATE.start_main1_~y~0#1| .cse3))) (and (= (mod .cse3 .cse4) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse4 0)) (= (mod .cse4 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 128 (+ |c_ULTIMATE.start_main1_~y~0#1| .cse3)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse9 (+ (- 256) (mod (+ .cse10 .cse8) 256)))) (let ((.cse6 (mod |c_ULTIMATE.start_main1_~y~0#1| .cse9))) (let ((.cse5 (mod .cse9 .cse6))) (and (= (mod (+ .cse5 (* .cse6 255)) 256) .cse7) (not (= .cse5 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse6 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (not (= .cse6 0)) (<= 128 (+ |c_ULTIMATE.start_main1_~y~0#1| .cse8)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse14 (+ (- 256) (mod (+ .cse10 .cse13) 256)))) (let ((.cse12 (mod |c_ULTIMATE.start_main1_~y~0#1| .cse14))) (let ((.cse11 (mod .cse14 .cse12))) (and (= (mod (+ .cse11 (* .cse12 255)) 256) .cse7) (not (= .cse11 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse12 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (+ |c_ULTIMATE.start_main1_~y~0#1| .cse13) 127) (not (= .cse12 0))))))))) .cse15)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|)) (and (let ((.cse30 (mod .cse10 256))) (let ((.cse16 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse58 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse22 (+ .cse30 (- 256))) (.cse28 (<= 128 .cse30)) (.cse38 (not (= .cse30 0))) (.cse39 (<= .cse30 127))) (or (and (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (let ((.cse18 (+ (- 256) (mod (+ .cse10 .cse21) 256)))) (let ((.cse20 (mod .cse22 .cse18))) (let ((.cse19 (+ (mod (+ .cse10 .cse20 .cse21) 256) (- 256)))) (let ((.cse17 (mod .cse19 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse16 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse17) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= .cse7 (mod (+ (mod .cse18 .cse19) .cse10 .cse20 .cse21) 256)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse21) 256)) (not (= .cse17 0))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (let ((.cse25 (+ (- 256) (mod (+ .cse10 .cse24) 256)))) (let ((.cse27 (mod .cse22 .cse25))) (let ((.cse26 (+ (mod (+ .cse10 .cse27 .cse24) 256) (- 256)))) (let ((.cse23 (mod .cse26 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse16 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse23) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse24) 256) 127) (= .cse7 (mod (+ (mod .cse25 .cse26) .cse10 .cse27 .cse24) 256)) (not (= .cse23 0)))))))))) .cse28) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse30))) (let ((.cse33 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse31) 256)))) (let ((.cse32 (mod .cse30 .cse33))) (let ((.cse29 (mod .cse33 .cse32))) (and (not (= .cse29 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (+ .cse30 .cse31)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse32 |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= .cse32 0)) (= .cse7 (mod (+ .cse29 (* .cse32 255)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse30))) (let ((.cse37 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse35) 256)))) (let ((.cse36 (mod .cse30 .cse37))) (let ((.cse34 (mod .cse37 .cse36))) (and (not (= .cse34 0)) (<= (+ .cse30 .cse35) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse36 |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= .cse36 0)) (= .cse7 (mod (+ .cse34 (* .cse36 255)) 256))))))))) .cse38 .cse39) (and (<= 128 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) (or (and .cse38 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse30))) (let ((.cse43 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse42) 256)))) (let ((.cse41 (mod .cse30 .cse43))) (let ((.cse40 (mod .cse43 .cse41))) (and (not (= .cse40 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= 0 (mod .cse41 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 128 (+ .cse30 .cse42)) (not (= .cse41 0)) (= .cse7 (mod (+ .cse40 (* .cse41 255)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse30))) (let ((.cse47 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse45) 256)))) (let ((.cse46 (mod .cse30 .cse47))) (let ((.cse44 (mod .cse47 .cse46))) (and (not (= .cse44 0)) (<= (+ .cse30 .cse45) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= 0 (mod .cse46 |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= .cse46 0)) (= .cse7 (mod (+ .cse44 (* .cse46 255)) 256))))))))) .cse39) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (let ((.cse52 (+ (- 256) (mod (+ .cse10 .cse49) 256)))) (let ((.cse51 (mod .cse22 .cse52))) (let ((.cse50 (+ (mod (+ .cse10 .cse51 .cse49) 256) (- 256)))) (let ((.cse48 (mod .cse52 .cse50))) (and (not (= .cse48 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse49) 256) 127) (= (mod .cse50 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse7 (mod (+ .cse48 .cse10 .cse51 .cse49) 256))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (let ((.cse57 (+ (- 256) (mod (+ .cse10 .cse56) 256)))) (let ((.cse55 (mod .cse22 .cse57))) (let ((.cse54 (+ (mod (+ .cse10 .cse55 .cse56) 256) (- 256)))) (let ((.cse53 (mod .cse57 .cse54))) (and (not (= .cse53 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod .cse54 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse7 (mod (+ .cse53 .cse10 .cse55 .cse56) 256)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse56) 256)))))))))) .cse28)) .cse58)) .cse15) (and .cse0 (let ((.cse62 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse59 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (let ((.cse60 (+ (mod (+ (mod .cse22 .cse59) (* 255 .cse59)) 256) (- 256)))) (let ((.cse61 (mod .cse60 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse59 .cse60)) (= (mod (+ .cse61 .cse62) 256) .cse16) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (not (= .cse61 0))))))) .cse28) (and .cse58 (or (and .cse38 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse64 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse30))) (let ((.cse63 (mod .cse30 .cse64))) (and (not (= .cse63 0)) (= (mod .cse63 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse64 .cse63)) (<= 128 (+ .cse30 .cse64)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse30))) (let ((.cse65 (mod .cse30 .cse66))) (and (not (= .cse65 0)) (= (mod .cse65 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= (+ .cse30 .cse66) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse66 .cse65)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|)))))) .cse39) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse67 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (let ((.cse68 (+ (mod (+ (mod .cse22 .cse67) (* 255 .cse67)) 256) (- 256)))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse67 .cse68)) (= (mod .cse68 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|))))) .cse28)) (<= 128 (mod .cse62 256))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse70 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse30))) (let ((.cse69 (mod .cse30 .cse70))) (and (not (= .cse69 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse70 .cse69)) (<= 128 (+ .cse30 .cse70)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod .cse69 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse72 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse30))) (let ((.cse71 (mod .cse30 .cse72))) (and (not (= .cse71 0)) (<= (+ .cse30 .cse72) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse72 .cse71)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod .cse71 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|)))))) .cse38 .cse39))))))) (<= (+ |c_ULTIMATE.start_main1_~y~0#1| 1) 0))))) is different from false [2024-11-14 05:42:21,405 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~g~0#1| 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| 127) (let ((.cse0 (<= (+ |c_ULTIMATE.start_main1_~g~0#1| 1) 0)) (.cse6 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse4 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse33 (<= 0 |c_ULTIMATE.start_main1_~g~0#1|))) (or (and (<= (+ |c_ULTIMATE.start_main1_~y~0#1| 1) 0) (let ((.cse18 (mod .cse4 256))) (let ((.cse25 (not (= .cse18 0))) (.cse26 (<= .cse18 127)) (.cse9 (+ .cse18 (- 256))) (.cse15 (<= 128 .cse18))) (or (and .cse0 (let ((.cse1 (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse18))) (let ((.cse20 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse19) 256)))) (let ((.cse17 (mod .cse18 .cse20))) (let ((.cse16 (mod .cse20 .cse17))) (and (not (= .cse16 0)) (= (mod .cse17 |c_ULTIMATE.start_main1_~g~0#1|) 0) (= .cse6 (mod (+ .cse16 (* .cse17 255)) 256)) (<= (+ .cse18 .cse19) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (not (= .cse17 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse18))) (let ((.cse24 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse23) 256)))) (let ((.cse22 (mod .cse18 .cse24))) (let ((.cse21 (mod .cse24 .cse22))) (and (not (= .cse21 0)) (= (mod .cse22 |c_ULTIMATE.start_main1_~g~0#1|) 0) (= .cse6 (mod (+ .cse21 (* .cse22 255)) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (+ .cse18 .cse23)) (not (= .cse22 0))))))))) .cse25 .cse26))) (or .cse1 (and (<= 128 (mod |c_ULTIMATE.start_main1_~g~0#1| 256)) (or .cse1 (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse9))) (let ((.cse8 (+ (- 256) (mod (+ .cse4 .cse3) 256)))) (let ((.cse5 (mod .cse9 .cse8))) (let ((.cse7 (+ (mod (+ .cse4 .cse5 .cse3) 256) (- 256)))) (let ((.cse2 (mod .cse8 .cse7))) (and (not (= .cse2 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse3) 256)) (= (mod (+ .cse2 .cse4 .cse5 .cse3) 256) .cse6) (= (mod .cse7 |c_ULTIMATE.start_main1_~g~0#1|) 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse9))) (let ((.cse14 (+ (- 256) (mod (+ .cse4 .cse11) 256)))) (let ((.cse12 (mod .cse9 .cse14))) (let ((.cse13 (+ (mod (+ .cse4 .cse12 .cse11) 256) (- 256)))) (let ((.cse10 (mod .cse14 .cse13))) (and (not (= .cse10 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse11) 256) 127) (= (mod (+ .cse10 .cse4 .cse12 .cse11) 256) .cse6) (= (mod .cse13 |c_ULTIMATE.start_main1_~g~0#1|) 0))))))))) .cse15)))))) (and (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse18))) (let ((.cse27 (mod .cse18 .cse28))) (and (not (= .cse27 0)) (<= (+ .cse18 .cse28) 127) (= |c_ULTIMATE.start_main1_~g~0#1| (mod .cse28 .cse27)) (= (mod .cse27 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse18))) (let ((.cse29 (mod .cse18 .cse30))) (and (not (= .cse29 0)) (= |c_ULTIMATE.start_main1_~g~0#1| (mod .cse30 .cse29)) (<= 128 (+ .cse18 .cse30)) (= (mod .cse29 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|)))))) .cse25 .cse26) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse9))) (let ((.cse32 (+ (mod (+ (mod .cse9 .cse31) (* 255 .cse31)) 256) (- 256)))) (and (= |c_ULTIMATE.start_main1_~g~0#1| (mod .cse31 .cse32)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod .cse32 |c_ULTIMATE.start_main1_~g~0#1|) 0))))) .cse15)) .cse33))))) (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (or (and .cse0 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse37 (+ (- 256) (mod (+ .cse4 .cse36) 256)))) (let ((.cse35 (mod |c_ULTIMATE.start_main1_~y~0#1| .cse37))) (let ((.cse34 (mod .cse37 .cse35))) (and (not (= .cse34 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (not (= .cse35 0)) (= (mod (+ .cse34 (* .cse35 255)) 256) .cse6) (<= 128 (+ |c_ULTIMATE.start_main1_~y~0#1| .cse36)) (= (mod .cse35 |c_ULTIMATE.start_main1_~g~0#1|) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse41 (+ (- 256) (mod (+ .cse4 .cse39) 256)))) (let ((.cse40 (mod |c_ULTIMATE.start_main1_~y~0#1| .cse41))) (let ((.cse38 (mod .cse41 .cse40))) (and (not (= .cse38 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (+ |c_ULTIMATE.start_main1_~y~0#1| .cse39) 127) (not (= .cse40 0)) (= (mod (+ .cse38 (* .cse40 255)) 256) .cse6) (= (mod .cse40 |c_ULTIMATE.start_main1_~g~0#1|) 0))))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse43 (mod |c_ULTIMATE.start_main1_~y~0#1| .cse42))) (and (<= (+ |c_ULTIMATE.start_main1_~y~0#1| .cse42) 127) (not (= .cse43 0)) (= (mod .cse42 .cse43) |c_ULTIMATE.start_main1_~g~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod .cse43 |c_ULTIMATE.start_main1_~g~0#1|) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse44 (mod |c_ULTIMATE.start_main1_~y~0#1| .cse45))) (and (not (= .cse44 0)) (= (mod .cse45 .cse44) |c_ULTIMATE.start_main1_~g~0#1|) (<= 128 (+ |c_ULTIMATE.start_main1_~y~0#1| .cse45)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod .cse44 |c_ULTIMATE.start_main1_~g~0#1|) 0)))))) .cse33)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|))))) is different from false [2024-11-14 05:42:25,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-14 05:42:25,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:43:15,278 WARN L286 SmtUtils]: Spent 36.29s on a formula simplification. DAG size of input: 81 DAG size of output: 53 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:43:54,298 WARN L286 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 05:44:50,028 WARN L286 SmtUtils]: Spent 49.97s on a formula simplification. DAG size of input: 96 DAG size of output: 74 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:46:24,756 WARN L286 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 05:47:23,453 WARN L286 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 05:48:13,190 WARN L286 SmtUtils]: Spent 5.97s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 05:49:33,932 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse15 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse1 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse5 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse6 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1)))) (and (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse0 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse2 (mod .cse0 256))) (let ((.cse3 (+ (mod (+ (* .cse0 255) (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse2)) 256) (- 256)))) (let ((.cse4 (mod .cse2 .cse3))) (or (< (mod (+ .cse0 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse0 .cse1) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse2) (not (= (mod .cse3 (mod .cse4 256)) 0)) (< .cse4 .cse5))))))) .cse6) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse7 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod (+ .cse7 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse9 (+ (- 256) (mod (+ (* .cse7 255) .cse1 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse8)) 256)))) (let ((.cse10 (mod .cse8 .cse9))) (or (< (mod .cse7 256) 128) (< 127 (mod (+ .cse7 .cse1) 256)) (< 127 .cse8) (not (= (mod .cse9 (mod .cse10 256)) 0)) (< .cse10 .cse5) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse11 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod .cse11 256))) (let ((.cse13 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse14) 256))) (let ((.cse12 (mod .cse14 .cse13))) (or (< (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse12 .cse5) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod .cse13 (mod .cse12 256)) 0)) (< 127 .cse14) (< (mod (+ .cse11 .cse1) 256) 128) (= .cse13 0))))))) .cse15) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse16 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod .cse16 256))) (let ((.cse18 (+ (mod (+ (* .cse16 255) (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse17)) 256) (- 256)))) (let ((.cse19 (mod .cse17 .cse18))) (or (< (mod (+ .cse16 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse17) (< (mod (+ .cse16 .cse1) 256) 128) (not (= (mod .cse18 (mod .cse19 256)) 0)) (< .cse19 .cse5)))))))) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse23 256))) (let ((.cse21 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse22) 256))) (let ((.cse20 (mod .cse22 .cse21))) (or (< .cse20 .cse5) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod .cse21 (mod .cse20 256)) 0)) (< 127 .cse22) (< 127 (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse23 .cse1) 256) 128) (= .cse21 0))))))) .cse15) (or (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse24 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod (+ .cse24 .cse1) 256))) (let ((.cse25 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse26))) (let ((.cse27 (mod .cse25 256))) (let ((.cse28 (mod .cse26 .cse27))) (or (< (mod (+ (* .cse24 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse25) 256) 128) (= .cse25 0) (< (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse26) (< 127 (mod .cse24 256)) (not (= (mod .cse27 (mod .cse28 256)) 0)) (< .cse28 .cse5) (= .cse24 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse32 (mod .cse29 256))) (let ((.cse31 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse32) 256))) (let ((.cse30 (mod .cse32 .cse31))) (or (< (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse30 .cse5) (< 127 (mod (+ .cse29 .cse1) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod .cse31 (mod .cse30 256)) 0)) (< 127 .cse32) (= .cse31 0)))))))) .cse15) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse35 (+ (- 256) (mod (+ (* .cse33 255) .cse1 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse34)) 256)))) (let ((.cse36 (mod .cse34 .cse35))) (or (< (mod .cse33 256) 128) (< 127 .cse34) (< (mod (+ .cse33 .cse1) 256) 128) (not (= (mod .cse35 (mod .cse36 256)) 0)) (< .cse36 .cse5) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) .cse6) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse37 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod (+ .cse37 .cse1) 256))) (let ((.cse38 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse39))) (let ((.cse40 (mod .cse38 256))) (let ((.cse41 (mod .cse39 .cse40))) (or (< (mod (+ (* .cse37 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse38) 256) 128) (< (mod .cse37 256) 128) (= .cse38 0) (< 127 .cse39) (< 127 (mod (+ .cse37 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse40 (mod .cse41 256)) 0)) (< .cse41 .cse5) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))) .cse15) (or .cse15 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse44 (mod (+ .cse42 .cse1) 256))) (let ((.cse43 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse44))) (let ((.cse45 (mod .cse43 256))) (let ((.cse46 (mod .cse44 .cse45))) (or (< (mod (+ (* .cse42 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse43) 256) 128) (< (mod .cse42 256) 128) (= .cse43 0) (< (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse44) (not (= (mod .cse45 (mod .cse46 256)) 0)) (< .cse46 .cse5) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (or .cse15 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse48 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse50 (mod .cse48 256))) (let ((.cse49 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse50) 256))) (let ((.cse47 (mod .cse50 .cse49))) (or (< .cse47 .cse5) (< 127 (mod (+ .cse48 .cse1) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod .cse49 (mod .cse47 256)) 0)) (< 127 .cse50) (< 127 (mod (+ .cse48 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse49 0))))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse53 (mod (+ .cse51 .cse1) 256))) (let ((.cse52 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse53))) (let ((.cse54 (mod .cse52 256))) (let ((.cse55 (mod .cse53 .cse54))) (or (< (mod (+ (* .cse51 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse52) 256) 128) (= .cse52 0) (< 127 .cse53) (< 127 (mod .cse51 256)) (< 127 (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse54 (mod .cse55 256)) 0)) (< .cse55 .cse5) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) (or .cse6 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse57 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse56 (mod .cse57 256))) (let ((.cse58 (+ (mod (+ (* .cse57 255) (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse56)) 256) (- 256)))) (let ((.cse59 (mod .cse56 .cse58))) (or (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse56) (< 127 (mod (+ .cse57 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse57 .cse1) 256) 128) (not (= (mod .cse58 (mod .cse59 256)) 0)) (< .cse59 .cse5))))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse60 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse61 (mod (+ .cse60 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse62 (+ (- 256) (mod (+ (* .cse60 255) .cse1 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse61)) 256)))) (let ((.cse63 (mod .cse61 .cse62))) (or (< 127 (mod .cse60 256)) (< 127 .cse61) (< (mod (+ .cse60 .cse1) 256) 128) (not (= (mod .cse62 (mod .cse63 256)) 0)) (< .cse63 .cse5) (= .cse60 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (or (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse64 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse65 (mod (+ .cse64 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse66 (+ (- 256) (mod (+ (* .cse64 255) .cse1 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse65)) 256)))) (let ((.cse67 (mod .cse65 .cse66))) (or (< 127 (mod (+ .cse64 .cse1) 256)) (< 127 (mod .cse64 256)) (< 127 .cse65) (not (= (mod .cse66 (mod .cse67 256)) 0)) (< .cse67 .cse5) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse68 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse69 (mod .cse68 256))) (let ((.cse70 (+ (mod (+ (* .cse68 255) (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse69)) 256) (- 256)))) (let ((.cse71 (mod .cse69 .cse70))) (or (< 127 (mod (+ .cse68 .cse1) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse69) (< 127 (mod (+ .cse68 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse70 (mod .cse71 256)) 0)) (< .cse71 .cse5)))))))) .cse6))) (< |c_ULTIMATE.start_main1_~y~0#1| 1) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2024-11-14 05:49:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-14 05:49:35,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930727613] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:49:35,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [295713686] [2024-11-14 05:49:35,077 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2024-11-14 05:49:35,077 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:49:35,077 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:49:35,077 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:49:35,077 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:49:35,332 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:49:38,495 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '323#(<= 1 |#StackHeapBarrier|)' at error location [2024-11-14 05:49:38,495 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:49:38,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:49:38,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-14 05:49:38,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798095890] [2024-11-14 05:49:38,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:49:38,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-14 05:49:38,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:49:38,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-14 05:49:38,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=432, Unknown=5, NotChecked=180, Total=702 [2024-11-14 05:49:38,498 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:49:40,906 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main1_~y~0#1| 1))) (and (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (and (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|)) (and (let ((.cse0 (mod (* |c_ULTIMATE.start_main1_~y~0#1| 255) 256))) (or (and (= .cse0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (<= 128 .cse0)) (and (= .cse0 |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse0 127)))) (<= .cse1 0))) (or (let ((.cse16 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse7 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1)))) (and (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse2 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse4 (mod .cse2 256))) (let ((.cse5 (+ (mod (+ (* .cse2 255) (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse4)) 256) (- 256)))) (let ((.cse6 (mod .cse4 .cse5))) (or (< (mod (+ .cse2 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse2 .cse3) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse4) (not (= (mod .cse5 (mod .cse6 256)) 0)) (< .cse6 .cse1))))))) .cse7) (or .cse7 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse8 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ .cse8 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse10 (+ (- 256) (mod (+ (* .cse8 255) .cse3 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse9)) 256)))) (let ((.cse11 (mod .cse9 .cse10))) (or (< (mod .cse8 256) 128) (< 127 (mod (+ .cse8 .cse3) 256)) (< 127 .cse9) (not (= (mod .cse10 (mod .cse11 256)) 0)) (< .cse11 .cse1) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse12 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod .cse12 256))) (let ((.cse14 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse15) 256))) (let ((.cse13 (mod .cse15 .cse14))) (or (< (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse13 .cse1) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod .cse14 (mod .cse13 256)) 0)) (< 127 .cse15) (< (mod (+ .cse12 .cse3) 256) 128) (= .cse14 0))))))) .cse16) (or .cse7 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse17 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod .cse17 256))) (let ((.cse19 (+ (mod (+ (* .cse17 255) (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse18)) 256) (- 256)))) (let ((.cse20 (mod .cse18 .cse19))) (or (< (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse18) (< (mod (+ .cse17 .cse3) 256) 128) (not (= (mod .cse19 (mod .cse20 256)) 0)) (< .cse20 .cse1)))))))) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse24 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse23 (mod .cse24 256))) (let ((.cse22 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse23) 256))) (let ((.cse21 (mod .cse23 .cse22))) (or (< .cse21 .cse1) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod .cse22 (mod .cse21 256)) 0)) (< 127 .cse23) (< 127 (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse24 .cse3) 256) 128) (= .cse22 0))))))) .cse16) (or (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod (+ .cse25 .cse3) 256))) (let ((.cse26 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse27))) (let ((.cse28 (mod .cse26 256))) (let ((.cse29 (mod .cse27 .cse28))) (or (< (mod (+ (* .cse25 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse26) 256) 128) (= .cse26 0) (< (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse27) (< 127 (mod .cse25 256)) (not (= (mod .cse28 (mod .cse29 256)) 0)) (< .cse29 .cse1) (= .cse25 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse30 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod .cse30 256))) (let ((.cse32 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse33) 256))) (let ((.cse31 (mod .cse33 .cse32))) (or (< (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse31 .cse1) (< 127 (mod (+ .cse30 .cse3) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod .cse32 (mod .cse31 256)) 0)) (< 127 .cse33) (= .cse32 0)))))))) .cse16) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse34 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse36 (+ (- 256) (mod (+ (* .cse34 255) .cse3 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse35)) 256)))) (let ((.cse37 (mod .cse35 .cse36))) (or (< (mod .cse34 256) 128) (< 127 .cse35) (< (mod (+ .cse34 .cse3) 256) 128) (not (= (mod .cse36 (mod .cse37 256)) 0)) (< .cse37 .cse1) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) .cse7) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse38 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse40 (mod (+ .cse38 .cse3) 256))) (let ((.cse39 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse40))) (let ((.cse41 (mod .cse39 256))) (let ((.cse42 (mod .cse40 .cse41))) (or (< (mod (+ (* .cse38 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse39) 256) 128) (< (mod .cse38 256) 128) (= .cse39 0) (< 127 .cse40) (< 127 (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse41 (mod .cse42 256)) 0)) (< .cse42 .cse1) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))) .cse16) (or .cse16 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse43 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse45 (mod (+ .cse43 .cse3) 256))) (let ((.cse44 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse45))) (let ((.cse46 (mod .cse44 256))) (let ((.cse47 (mod .cse45 .cse46))) (or (< (mod (+ (* .cse43 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse44) 256) 128) (< (mod .cse43 256) 128) (= .cse44 0) (< (mod (+ .cse43 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse45) (not (= (mod .cse46 (mod .cse47 256)) 0)) (< .cse47 .cse1) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (or .cse16 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse49 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse51 (mod .cse49 256))) (let ((.cse50 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse51) 256))) (let ((.cse48 (mod .cse51 .cse50))) (or (< .cse48 .cse1) (< 127 (mod (+ .cse49 .cse3) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod .cse50 (mod .cse48 256)) 0)) (< 127 .cse51) (< 127 (mod (+ .cse49 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse50 0))))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse52 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse54 (mod (+ .cse52 .cse3) 256))) (let ((.cse53 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse54))) (let ((.cse55 (mod .cse53 256))) (let ((.cse56 (mod .cse54 .cse55))) (or (< (mod (+ (* .cse52 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse53) 256) 128) (= .cse53 0) (< 127 .cse54) (< 127 (mod .cse52 256)) (< 127 (mod (+ .cse52 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse55 (mod .cse56 256)) 0)) (< .cse56 .cse1) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) (or .cse7 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse58 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse57 (mod .cse58 256))) (let ((.cse59 (+ (mod (+ (* .cse58 255) (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse57)) 256) (- 256)))) (let ((.cse60 (mod .cse57 .cse59))) (or (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse57) (< 127 (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse58 .cse3) 256) 128) (not (= (mod .cse59 (mod .cse60 256)) 0)) (< .cse60 .cse1))))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse61 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse62 (mod (+ .cse61 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse63 (+ (- 256) (mod (+ (* .cse61 255) .cse3 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse62)) 256)))) (let ((.cse64 (mod .cse62 .cse63))) (or (< 127 (mod .cse61 256)) (< 127 .cse62) (< (mod (+ .cse61 .cse3) 256) 128) (not (= (mod .cse63 (mod .cse64 256)) 0)) (< .cse64 .cse1) (= .cse61 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (or (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse65 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse66 (mod (+ .cse65 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse67 (+ (- 256) (mod (+ (* .cse65 255) .cse3 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse66)) 256)))) (let ((.cse68 (mod .cse66 .cse67))) (or (< 127 (mod (+ .cse65 .cse3) 256)) (< 127 (mod .cse65 256)) (< 127 .cse66) (not (= (mod .cse67 (mod .cse68 256)) 0)) (< .cse68 .cse1) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse69 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse70 (mod .cse69 256))) (let ((.cse71 (+ (mod (+ (* .cse69 255) (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse70)) 256) (- 256)))) (let ((.cse72 (mod .cse70 .cse71))) (or (< 127 (mod (+ .cse69 .cse3) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse70) (< 127 (mod (+ .cse69 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse71 (mod .cse72 256)) 0)) (< .cse72 .cse1)))))))) .cse7))) (< |c_ULTIMATE.start_main1_~y~0#1| 1) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)))) is different from true [2024-11-14 05:49:43,680 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse34 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse44 (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse2 (< |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse0 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse59 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse25 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse1 (+ |c_ULTIMATE.start_main1_~y~0#1| 1))) (and (or (not .cse0) (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse1) .cse2) (let ((.cse29 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse14 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse15 (mod .cse29 256))) (let ((.cse32 (<= 128 .cse15)) (.cse33 (<= .cse14 127)) (.cse9 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse5 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (let ((.cse24 (mod .cse5 256))) (or (and (let ((.cse3 (<= .cse25 0)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse6 (+ .cse24 (- 256)))) (or (and .cse3 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse6))) (let ((.cse7 (+ (- 256) (mod (+ .cse5 .cse8) 256)))) (let ((.cse10 (mod .cse7 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse4 (mod (+ .cse5 (mod .cse6 .cse7) .cse8) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse8) 256)) (= .cse9 (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse10 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse6))) (let ((.cse11 (+ (- 256) (mod (+ .cse5 .cse12) 256)))) (let ((.cse13 (mod .cse11 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse4 (mod (+ .cse5 (mod .cse6 .cse11) .cse12) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse12) 256) 127) (= .cse9 (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse13 0))))))) (and (<= 128 .cse14) (<= .cse15 127) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse6))) (let ((.cse18 (+ (- 256) (mod (+ .cse5 .cse17) 256)))) (let ((.cse16 (mod .cse6 .cse18))) (and (= .cse4 (mod (+ .cse5 .cse16 .cse17) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod .cse18 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse16 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse17) 256))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse6))) (let ((.cse21 (+ (- 256) (mod (+ .cse5 .cse20) 256)))) (let ((.cse19 (mod .cse6 .cse21))) (and (= .cse4 (mod (+ .cse5 .cse19 .cse20) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse20) 256) 127) (= (mod .cse21 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse19 0)))))))) .cse0))) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse6))) (let ((.cse22 (mod .cse6 .cse23))) (and (not (= .cse22 0)) (not (= .cse23 0)) (= (mod .cse23 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= .cse4 (mod (+ .cse22 (* 255 .cse23)) 256))))))))) (<= 128 .cse24)) (and (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse24))) (let ((.cse26 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse28) 256)))) (let ((.cse27 (mod .cse26 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod .cse24 .cse26) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse27 0)) (<= (+ .cse24 .cse28) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod (+ .cse29 .cse27) 256) .cse9)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse24))) (let ((.cse30 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse31) 256)))) (and (= (mod .cse24 .cse30) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (+ .cse24 .cse31) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod .cse30 |c_ULTIMATE.start_gcd_test_~a#1|) 0))))) .cse0 .cse32 .cse33)) .cse34) (and .cse34 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse24))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse24 .cse35)) (<= 128 (+ .cse24 .cse35)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod .cse35 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse24))) (and (= (mod .cse36 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse24 .cse36)) (<= 128 (+ .cse24 .cse36)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|)))) .cse0 .cse32 .cse33))) (and (or (and .cse0 .cse32 .cse33 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse24))) (let ((.cse37 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse38) 256)))) (and (= (mod .cse24 .cse37) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (+ .cse24 .cse38)) (= (mod .cse37 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse24))) (let ((.cse39 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse41) 256)))) (let ((.cse40 (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod .cse24 .cse39) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse40 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (+ .cse24 .cse41)) (= (mod (+ .cse29 .cse40) 256) .cse9))))))) .cse34) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse24))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse24 .cse42)) (<= (+ .cse24 .cse42) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (not (= .cse42 0)) (= (mod .cse42 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|)))) (and .cse0 .cse32 .cse33 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse24))) (and (= (mod .cse43 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse24 .cse43)) (<= (+ .cse24 .cse43) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (not (= .cse43 0))))))) .cse34)) (not (= .cse24 0)) (<= .cse24 127)))) (<= .cse1 0)) (and (not .cse44) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse47 (+ (- 256) (mod (+ .cse5 .cse45) 256)))) (let ((.cse46 (mod .cse47 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (+ |c_ULTIMATE.start_main1_~y~0#1| .cse45) 127) (= (mod (+ .cse29 .cse46) 256) .cse9) (not (= .cse46 0)) (= (mod |c_ULTIMATE.start_main1_~y~0#1| .cse47) |c_ULTIMATE.start_gcd_test_~a#1|)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= (+ |c_ULTIMATE.start_main1_~y~0#1| .cse48) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse48 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |c_ULTIMATE.start_main1_~y~0#1| .cse48)) (not (= .cse48 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse49 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 128 (+ |c_ULTIMATE.start_main1_~y~0#1| .cse49)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |c_ULTIMATE.start_main1_~y~0#1| .cse49))))) (and .cse0 .cse32 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse50 (+ (- 256) (mod (+ .cse5 .cse51) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod .cse50 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 128 (+ |c_ULTIMATE.start_main1_~y~0#1| .cse51)) (= (mod |c_ULTIMATE.start_main1_~y~0#1| .cse50) |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= (mod .cse52 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= (+ |c_ULTIMATE.start_main1_~y~0#1| .cse52) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |c_ULTIMATE.start_main1_~y~0#1| .cse52)) (not (= .cse52 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse54 (+ (- 256) (mod (+ .cse5 .cse53) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (+ |c_ULTIMATE.start_main1_~y~0#1| .cse53) 127) (= (mod .cse54 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod |c_ULTIMATE.start_main1_~y~0#1| .cse54) |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= (mod .cse55 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 128 (+ |c_ULTIMATE.start_main1_~y~0#1| .cse55)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |c_ULTIMATE.start_main1_~y~0#1| .cse55)))))) .cse33) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse57 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse58 (+ (- 256) (mod (+ .cse5 .cse57) 256)))) (let ((.cse56 (mod .cse58 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod (+ .cse29 .cse56) 256) .cse9) (not (= .cse56 0)) (<= 128 (+ |c_ULTIMATE.start_main1_~y~0#1| .cse57)) (= (mod |c_ULTIMATE.start_main1_~y~0#1| .cse58) |c_ULTIMATE.start_gcd_test_~a#1|))))))) .cse34 (<= 0 |c_ULTIMATE.start_main1_~y~0#1|)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (or .cse59 (< |c_ULTIMATE.start_main1_~y~0#1| 0) (and .cse34 (or .cse44 .cse0 (< (+ |c_ULTIMATE.start_gcd_test_~b#1| 2) |c_ULTIMATE.start_main1_~y~0#1|)))) (or .cse2 .cse0 (let ((.cse70 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse70 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse72 (mod (+ .cse70 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse67 (< 127 .cse72)) (.cse68 (< .cse72 .cse1)) (.cse69 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse72) 0))) (.cse62 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse63 (< .cse71 .cse1)) (.cse64 (< 127 .cse71)) (.cse65 (< 0 .cse25)) (.cse66 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse71) 0))) (.cse60 (mod .cse70 256))) (and (or (< 127 .cse60) (let ((.cse61 (= .cse70 0))) (and (or .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (or .cse67 .cse61 .cse59 .cse68 .cse69 .cse65) (or (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse60) 0)) (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (< .cse60 .cse1))))) (or (and (or .cse67 .cse59 .cse68 .cse69 .cse65) (or .cse62 .cse63 .cse64 .cse65 .cse66)) (< .cse60 128))))))))) is different from false [2024-11-14 05:49:45,720 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse87 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (< |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse61 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse2 (= .cse87 0)) (.cse76 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse0 (+ |c_ULTIMATE.start_main1_~y~0#1| 1))) (and (or (< |c_ULTIMATE.start_gcd_test_~b#1| .cse0) (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) .cse1 (not .cse2)) (or .cse1 (< |c_ULTIMATE.start_gcd_test_~a#1| 1) (< (+ |c_ULTIMATE.start_gcd_test_~a#1| 2) |c_ULTIMATE.start_main1_~y~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse10 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse18 (<= .cse76 0)) (.cse3 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse13 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (or (and .cse3 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse5 (mod |c_ULTIMATE.start_main1_~y~0#1| .cse4))) (and (<= (+ |c_ULTIMATE.start_main1_~y~0#1| .cse4) 127) (= (mod .cse4 .cse5) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse5 0)) (= (mod .cse5 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse7 (mod |c_ULTIMATE.start_main1_~y~0#1| .cse6))) (and (= (mod .cse6 .cse7) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse7 0)) (= (mod .cse7 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 128 (+ |c_ULTIMATE.start_main1_~y~0#1| .cse6)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse12 (+ (- 256) (mod (+ .cse13 .cse11) 256)))) (let ((.cse9 (mod |c_ULTIMATE.start_main1_~y~0#1| .cse12))) (let ((.cse8 (mod .cse12 .cse9))) (and (= (mod (+ .cse8 (* .cse9 255)) 256) .cse10) (not (= .cse8 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse9 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (not (= .cse9 0)) (<= 128 (+ |c_ULTIMATE.start_main1_~y~0#1| .cse11)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse17 (+ (- 256) (mod (+ .cse13 .cse16) 256)))) (let ((.cse15 (mod |c_ULTIMATE.start_main1_~y~0#1| .cse17))) (let ((.cse14 (mod .cse17 .cse15))) (and (= (mod (+ .cse14 (* .cse15 255)) 256) .cse10) (not (= .cse14 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse15 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (+ |c_ULTIMATE.start_main1_~y~0#1| .cse16) 127) (not (= .cse15 0))))))))) .cse18)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|)) (and (let ((.cse33 (mod .cse13 256))) (let ((.cse19 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse25 (+ .cse33 (- 256))) (.cse31 (<= 128 .cse33)) (.cse41 (not (= .cse33 0))) (.cse42 (<= .cse33 127))) (or (and (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse25))) (let ((.cse21 (+ (- 256) (mod (+ .cse13 .cse24) 256)))) (let ((.cse23 (mod .cse25 .cse21))) (let ((.cse22 (+ (mod (+ .cse13 .cse23 .cse24) 256) (- 256)))) (let ((.cse20 (mod .cse22 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse19 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse20) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= .cse10 (mod (+ (mod .cse21 .cse22) .cse13 .cse23 .cse24) 256)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse24) 256)) (not (= .cse20 0))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse25))) (let ((.cse28 (+ (- 256) (mod (+ .cse13 .cse27) 256)))) (let ((.cse30 (mod .cse25 .cse28))) (let ((.cse29 (+ (mod (+ .cse13 .cse30 .cse27) 256) (- 256)))) (let ((.cse26 (mod .cse29 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse19 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse26) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse27) 256) 127) (= .cse10 (mod (+ (mod .cse28 .cse29) .cse13 .cse30 .cse27) 256)) (not (= .cse26 0)))))))))) .cse31) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse33))) (let ((.cse36 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse34) 256)))) (let ((.cse35 (mod .cse33 .cse36))) (let ((.cse32 (mod .cse36 .cse35))) (and (not (= .cse32 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (+ .cse33 .cse34)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse35 |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= .cse35 0)) (= .cse10 (mod (+ .cse32 (* .cse35 255)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse33))) (let ((.cse40 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse38) 256)))) (let ((.cse39 (mod .cse33 .cse40))) (let ((.cse37 (mod .cse40 .cse39))) (and (not (= .cse37 0)) (<= (+ .cse33 .cse38) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= .cse39 0)) (= .cse10 (mod (+ .cse37 (* .cse39 255)) 256))))))))) .cse41 .cse42) (and (<= 128 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) (or (and .cse41 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse33))) (let ((.cse46 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse45) 256)))) (let ((.cse44 (mod .cse33 .cse46))) (let ((.cse43 (mod .cse46 .cse44))) (and (not (= .cse43 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= 0 (mod .cse44 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 128 (+ .cse33 .cse45)) (not (= .cse44 0)) (= .cse10 (mod (+ .cse43 (* .cse44 255)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse33))) (let ((.cse50 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse48) 256)))) (let ((.cse49 (mod .cse33 .cse50))) (let ((.cse47 (mod .cse50 .cse49))) (and (not (= .cse47 0)) (<= (+ .cse33 .cse48) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= 0 (mod .cse49 |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= .cse49 0)) (= .cse10 (mod (+ .cse47 (* .cse49 255)) 256))))))))) .cse42) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse25))) (let ((.cse55 (+ (- 256) (mod (+ .cse13 .cse52) 256)))) (let ((.cse54 (mod .cse25 .cse55))) (let ((.cse53 (+ (mod (+ .cse13 .cse54 .cse52) 256) (- 256)))) (let ((.cse51 (mod .cse55 .cse53))) (and (not (= .cse51 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse52) 256) 127) (= (mod .cse53 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse10 (mod (+ .cse51 .cse13 .cse54 .cse52) 256))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse59 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse25))) (let ((.cse60 (+ (- 256) (mod (+ .cse13 .cse59) 256)))) (let ((.cse58 (mod .cse25 .cse60))) (let ((.cse57 (+ (mod (+ .cse13 .cse58 .cse59) 256) (- 256)))) (let ((.cse56 (mod .cse60 .cse57))) (and (not (= .cse56 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod .cse57 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse10 (mod (+ .cse56 .cse13 .cse58 .cse59) 256)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse59) 256)))))))))) .cse31)) .cse61)) .cse18) (and .cse3 (let ((.cse65 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse25))) (let ((.cse63 (+ (mod (+ (mod .cse25 .cse62) (* 255 .cse62)) 256) (- 256)))) (let ((.cse64 (mod .cse63 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse62 .cse63)) (= (mod (+ .cse64 .cse65) 256) .cse19) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (not (= .cse64 0))))))) .cse31) (and .cse61 (or (and .cse41 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse67 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse33))) (let ((.cse66 (mod .cse33 .cse67))) (and (not (= .cse66 0)) (= (mod .cse66 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse67 .cse66)) (<= 128 (+ .cse33 .cse67)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse69 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse33))) (let ((.cse68 (mod .cse33 .cse69))) (and (not (= .cse68 0)) (= (mod .cse68 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= (+ .cse33 .cse69) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse69 .cse68)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|)))))) .cse42) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse70 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse25))) (let ((.cse71 (+ (mod (+ (mod .cse25 .cse70) (* 255 .cse70)) 256) (- 256)))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse70 .cse71)) (= (mod .cse71 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|))))) .cse31)) (<= 128 (mod .cse65 256))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse33))) (let ((.cse72 (mod .cse33 .cse73))) (and (not (= .cse72 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse73 .cse72)) (<= 128 (+ .cse33 .cse73)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod .cse72 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse75 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse33))) (let ((.cse74 (mod .cse33 .cse75))) (and (not (= .cse74 0)) (<= (+ .cse33 .cse75) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse75 .cse74)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod .cse74 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|)))))) .cse41 .cse42))))))) (<= .cse0 0)))) (or .cse1 .cse61 (let ((.cse88 (mod (+ .cse87 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse89 (mod (+ .cse87 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse83 (< 127 .cse89)) (.cse84 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse85 (< .cse89 .cse0)) (.cse86 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse89) 0))) (.cse78 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse79 (< .cse88 .cse0)) (.cse80 (< 127 .cse88)) (.cse81 (< 0 .cse76)) (.cse82 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse88) 0))) (.cse77 (mod .cse87 256))) (and (or (< 127 .cse77) (and (or .cse2 .cse78 .cse79 .cse80 .cse81 .cse82) (or .cse83 .cse2 .cse84 .cse85 .cse86 .cse81) (or (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse77) 0)) (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (< .cse77 .cse0)))) (or (and (or .cse83 .cse84 .cse85 .cse86 .cse81) (or .cse78 .cse79 .cse80 .cse81 .cse82)) (< .cse77 128))))))))) is different from false [2024-11-14 05:49:47,859 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~g~0#1| 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| 127) (or (< (+ 2 |c_ULTIMATE.start_main1_~g~0#1|) |c_ULTIMATE.start_main1_~y~0#1|) (< |c_ULTIMATE.start_main1_~g~0#1| 1) (< |c_ULTIMATE.start_main1_~y~0#1| 1)) (let ((.cse0 (<= (+ |c_ULTIMATE.start_main1_~g~0#1| 1) 0)) (.cse6 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse4 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse33 (<= 0 |c_ULTIMATE.start_main1_~g~0#1|))) (or (and (<= (+ |c_ULTIMATE.start_main1_~y~0#1| 1) 0) (let ((.cse18 (mod .cse4 256))) (let ((.cse25 (not (= .cse18 0))) (.cse26 (<= .cse18 127)) (.cse9 (+ .cse18 (- 256))) (.cse15 (<= 128 .cse18))) (or (and .cse0 (let ((.cse1 (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse18))) (let ((.cse20 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse19) 256)))) (let ((.cse17 (mod .cse18 .cse20))) (let ((.cse16 (mod .cse20 .cse17))) (and (not (= .cse16 0)) (= (mod .cse17 |c_ULTIMATE.start_main1_~g~0#1|) 0) (= .cse6 (mod (+ .cse16 (* .cse17 255)) 256)) (<= (+ .cse18 .cse19) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (not (= .cse17 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse18))) (let ((.cse24 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse23) 256)))) (let ((.cse22 (mod .cse18 .cse24))) (let ((.cse21 (mod .cse24 .cse22))) (and (not (= .cse21 0)) (= (mod .cse22 |c_ULTIMATE.start_main1_~g~0#1|) 0) (= .cse6 (mod (+ .cse21 (* .cse22 255)) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (+ .cse18 .cse23)) (not (= .cse22 0))))))))) .cse25 .cse26))) (or .cse1 (and (<= 128 (mod |c_ULTIMATE.start_main1_~g~0#1| 256)) (or .cse1 (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse9))) (let ((.cse8 (+ (- 256) (mod (+ .cse4 .cse3) 256)))) (let ((.cse5 (mod .cse9 .cse8))) (let ((.cse7 (+ (mod (+ .cse4 .cse5 .cse3) 256) (- 256)))) (let ((.cse2 (mod .cse8 .cse7))) (and (not (= .cse2 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse3) 256)) (= (mod (+ .cse2 .cse4 .cse5 .cse3) 256) .cse6) (= (mod .cse7 |c_ULTIMATE.start_main1_~g~0#1|) 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse9))) (let ((.cse14 (+ (- 256) (mod (+ .cse4 .cse11) 256)))) (let ((.cse12 (mod .cse9 .cse14))) (let ((.cse13 (+ (mod (+ .cse4 .cse12 .cse11) 256) (- 256)))) (let ((.cse10 (mod .cse14 .cse13))) (and (not (= .cse10 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse11) 256) 127) (= (mod (+ .cse10 .cse4 .cse12 .cse11) 256) .cse6) (= (mod .cse13 |c_ULTIMATE.start_main1_~g~0#1|) 0))))))))) .cse15)))))) (and (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse18))) (let ((.cse27 (mod .cse18 .cse28))) (and (not (= .cse27 0)) (<= (+ .cse18 .cse28) 127) (= |c_ULTIMATE.start_main1_~g~0#1| (mod .cse28 .cse27)) (= (mod .cse27 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse18))) (let ((.cse29 (mod .cse18 .cse30))) (and (not (= .cse29 0)) (= |c_ULTIMATE.start_main1_~g~0#1| (mod .cse30 .cse29)) (<= 128 (+ .cse18 .cse30)) (= (mod .cse29 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|)))))) .cse25 .cse26) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse9))) (let ((.cse32 (+ (mod (+ (mod .cse9 .cse31) (* 255 .cse31)) 256) (- 256)))) (and (= |c_ULTIMATE.start_main1_~g~0#1| (mod .cse31 .cse32)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod .cse32 |c_ULTIMATE.start_main1_~g~0#1|) 0))))) .cse15)) .cse33))))) (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (or (and .cse0 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse37 (+ (- 256) (mod (+ .cse4 .cse36) 256)))) (let ((.cse35 (mod |c_ULTIMATE.start_main1_~y~0#1| .cse37))) (let ((.cse34 (mod .cse37 .cse35))) (and (not (= .cse34 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (not (= .cse35 0)) (= (mod (+ .cse34 (* .cse35 255)) 256) .cse6) (<= 128 (+ |c_ULTIMATE.start_main1_~y~0#1| .cse36)) (= (mod .cse35 |c_ULTIMATE.start_main1_~g~0#1|) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse41 (+ (- 256) (mod (+ .cse4 .cse39) 256)))) (let ((.cse40 (mod |c_ULTIMATE.start_main1_~y~0#1| .cse41))) (let ((.cse38 (mod .cse41 .cse40))) (and (not (= .cse38 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (+ |c_ULTIMATE.start_main1_~y~0#1| .cse39) 127) (not (= .cse40 0)) (= (mod (+ .cse38 (* .cse40 255)) 256) .cse6) (= (mod .cse40 |c_ULTIMATE.start_main1_~g~0#1|) 0))))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse43 (mod |c_ULTIMATE.start_main1_~y~0#1| .cse42))) (and (<= (+ |c_ULTIMATE.start_main1_~y~0#1| .cse42) 127) (not (= .cse43 0)) (= (mod .cse42 .cse43) |c_ULTIMATE.start_main1_~g~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod .cse43 |c_ULTIMATE.start_main1_~g~0#1|) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse44 (mod |c_ULTIMATE.start_main1_~y~0#1| .cse45))) (and (not (= .cse44 0)) (= (mod .cse45 .cse44) |c_ULTIMATE.start_main1_~g~0#1|) (<= 128 (+ |c_ULTIMATE.start_main1_~y~0#1| .cse45)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod .cse44 |c_ULTIMATE.start_main1_~g~0#1|) 0)))))) .cse33)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|))))) is different from false [2024-11-14 05:49:52,111 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 [] [2024-11-14 05:49:54,736 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 [] [2024-11-14 05:49:56,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-14 05:49:56,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:49:56,581 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-14 05:49:56,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:49:56,582 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-14 05:49:56,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:49:56,582 INFO L225 Difference]: With dead ends: 32 [2024-11-14 05:49:56,583 INFO L226 Difference]: Without dead ends: 27 [2024-11-14 05:49:56,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 118.3s TimeCoverageRelationStatistics Valid=102, Invalid=472, Unknown=10, NotChecked=408, Total=992 [2024-11-14 05:49:56,585 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:49:56,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 2 Unknown, 158 Unchecked, 7.8s Time] [2024-11-14 05:49:56,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-14 05:49:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-14 05:49:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 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) [2024-11-14 05:49:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-14 05:49:56,608 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2024-11-14 05:49:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:49:56,609 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-14 05:49:56,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:49:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-14 05:49:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 05:49:56,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:49:56,610 INFO L215 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2024-11-14 05:49:56,626 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 05:49:56,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c0b52cd-c738-4eab-b944-193b9275866a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-14 05:49:56,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:49:56,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:49:56,811 INFO L85 PathProgramCache]: Analyzing trace with hash -988272051, now seen corresponding path program 3 times [2024-11-14 05:49:56,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:49:56,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868157339] [2024-11-14 05:49:56,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:49:56,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:49:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat