./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_2_6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_6.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje --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 3d09a4cc0bc23b63ede1d1b9d8e202055edfb550f267c616041c6cb452339e6a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:07:14,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:07:14,193 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 06:07:14,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:07:14,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:07:14,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:07:14,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:07:14,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:07:14,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:07:14,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:07:14,249 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:07:14,250 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:07:14,250 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:07:14,253 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:07:14,254 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:07:14,254 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:07:14,254 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:07:14,255 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:07:14,255 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:07:14,256 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:07:14,256 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:07:14,260 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:07:14,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:07:14,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:07:14,262 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:07:14,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:07:14,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:07:14,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:07:14,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:07:14,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:07:14,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:07:14,267 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:07:14,267 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:07:14,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:07:14,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:07:14,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:07:14,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:07:14,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:07:14,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:07:14,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:07:14,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:07:14,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:07:14,273 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:07:14,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:07:14,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:07:14,274 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:07:14,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:07:14,274 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje 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 -> 3d09a4cc0bc23b63ede1d1b9d8e202055edfb550f267c616041c6cb452339e6a [2024-11-09 06:07:14,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:07:14,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:07:14,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:07:14,603 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:07:14,604 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:07:14,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/combinations/gcd_3+newton_2_6.i Unable to find full path for "g++" [2024-11-09 06:07:16,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:07:17,052 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:07:17,052 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i [2024-11-09 06:07:17,061 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/data/b3b7ba93c/cf8a8686812d437daf277a52e1b189af/FLAGa4579f9ab [2024-11-09 06:07:17,081 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/data/b3b7ba93c/cf8a8686812d437daf277a52e1b189af [2024-11-09 06:07:17,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:07:17,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:07:17,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:07:17,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:07:17,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:07:17,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:07:17" (1/1) ... [2024-11-09 06:07:17,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c23f576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:07:17, skipping insertion in model container [2024-11-09 06:07:17,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:07:17" (1/1) ... [2024-11-09 06:07:17,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:07:17,345 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_03fa5a75-d503-4735-bae5-612881a90a32/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i[1226,1239] [2024-11-09 06:07:17,378 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_03fa5a75-d503-4735-bae5-612881a90a32/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i[2841,2854] [2024-11-09 06:07:17,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:07:17,391 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:07:17,407 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_03fa5a75-d503-4735-bae5-612881a90a32/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i[1226,1239] [2024-11-09 06:07:17,420 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_03fa5a75-d503-4735-bae5-612881a90a32/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i[2841,2854] [2024-11-09 06:07:17,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:07:17,443 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:07:17,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:07:17 WrapperNode [2024-11-09 06:07:17,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:07:17,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:07:17,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:07:17,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:07:17,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:07:17" (1/1) ... [2024-11-09 06:07:17,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:07:17" (1/1) ... [2024-11-09 06:07:17,488 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2024-11-09 06:07:17,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:07:17,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:07:17,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:07:17,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:07:17,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:07:17" (1/1) ... [2024-11-09 06:07:17,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:07:17" (1/1) ... [2024-11-09 06:07:17,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:07:17" (1/1) ... [2024-11-09 06:07:17,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:07:17" (1/1) ... [2024-11-09 06:07:17,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:07:17" (1/1) ... [2024-11-09 06:07:17,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:07:17" (1/1) ... [2024-11-09 06:07:17,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:07:17" (1/1) ... [2024-11-09 06:07:17,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:07:17" (1/1) ... [2024-11-09 06:07:17,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:07:17,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:07:17,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:07:17,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:07:17,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:07:17" (1/1) ... [2024-11-09 06:07:17,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:07:17,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:07:17,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:07:17,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:07:17,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:07:17,600 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-09 06:07:17,601 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-09 06:07:17,601 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-09 06:07:17,601 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-09 06:07:17,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:07:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:07:17,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:07:17,692 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:07:17,695 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:07:17,982 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-09 06:07:17,983 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:07:18,090 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:07:18,090 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:07:18,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:07:18 BoogieIcfgContainer [2024-11-09 06:07:18,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:07:18,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:07:18,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:07:18,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:07:18,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:07:17" (1/3) ... [2024-11-09 06:07:18,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2525ea68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:07:18, skipping insertion in model container [2024-11-09 06:07:18,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:07:17" (2/3) ... [2024-11-09 06:07:18,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2525ea68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:07:18, skipping insertion in model container [2024-11-09 06:07:18,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:07:18" (3/3) ... [2024-11-09 06:07:18,107 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_6.i [2024-11-09 06:07:18,130 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:07:18,131 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 06:07:18,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:07:18,251 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;@4af303ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:07:18,252 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 06:07:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:07:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:07:18,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:07:18,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:07:18,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:07:18,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:07:18,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1074225707, now seen corresponding path program 1 times [2024-11-09 06:07:18,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:07:18,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297549529] [2024-11-09 06:07:18,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:07:18,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:07:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:07:18,944 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-09 06:07:18,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:07:18,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297549529] [2024-11-09 06:07:18,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297549529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:07:18,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:07:18,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:07:18,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345917063] [2024-11-09 06:07:18,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:07:18,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:07:18,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:07:18,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:07:18,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:07:18,994 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-09 06:07:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:07:19,128 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-11-09 06:07:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:07:19,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-09 06:07:19,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:07:19,140 INFO L225 Difference]: With dead ends: 39 [2024-11-09 06:07:19,141 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 06:07:19,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:07:19,150 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:07:19,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 74 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:07:19,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 06:07:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 06:07:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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-09 06:07:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-09 06:07:19,209 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2024-11-09 06:07:19,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:07:19,209 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-09 06:07:19,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-09 06:07:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-09 06:07:19,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 06:07:19,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:07:19,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:07:19,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:07:19,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:07:19,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:07:19,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1198724816, now seen corresponding path program 1 times [2024-11-09 06:07:19,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:07:19,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78293010] [2024-11-09 06:07:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:07:19,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:07:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 06:07:19,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [377262922] [2024-11-09 06:07:19,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:07:19,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:07:19,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:07:19,341 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:07:19,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:07:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:07:19,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 06:07:19,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:07:23,503 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse8 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse6 (<= .cse7 127)) (.cse5 (<= 128 .cse7)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse2 (+ .cse7 (- 256))) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))) .cse0) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) .cse0) (and (or (and (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (let ((.cse3 (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= .cse3 0)) (= (mod (+ .cse3 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_24|)) 256) .cse4))))) .cse5) (and .cse6 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) .cse8) (and .cse8 (or (and .cse6 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) (and .cse5 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (let ((.cse9 (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= (mod (+ .cse9 |v_ULTIMATE.start_gcd_test_~b#1_24|) 256) .cse4) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (not (= .cse9 0))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0))) .cse1)))))))) is different from true [2024-11-09 06:07:23,906 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse5 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse4 (<= 128 .cse2)) (.cse3 (+ .cse2 (- 256))) (.cse1 (<= .cse2 127))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) .cse0) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))) .cse0) (and (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (= (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0))) .cse4)) .cse5) (and .cse5 (or (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (= (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))))))))) is different from true [2024-11-09 06:07:24,348 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse3 (<= .cse2 127)) (.cse5 (+ .cse2 (- 256))) (.cse4 (<= 128 .cse2)) (.cse1 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))) .cse0) (and .cse1 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))) .cse3) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (= (mod .cse5 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) .cse0) (and (or (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (= (mod .cse5 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0))) .cse4)) .cse1)))) is different from true [2024-11-09 06:07:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 06:07:24,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:07:26,264 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-09 06:07:26,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:07:26,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78293010] [2024-11-09 06:07:26,265 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 06:07:26,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377262922] [2024-11-09 06:07:26,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377262922] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:07:26,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [846358347] [2024-11-09 06:07:26,294 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 06:07:26,295 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:07:26,299 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:07:26,306 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:07:26,308 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:07:27,518 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:07:28,055 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '180#(<= 1 |#StackHeapBarrier|)' at error location [2024-11-09 06:07:28,056 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:07:28,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:07:28,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2024-11-09 06:07:28,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618659745] [2024-11-09 06:07:28,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:07:28,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:07:28,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:07:28,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:07:28,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=170, Unknown=3, NotChecked=84, Total=306 [2024-11-09 06:07:28,060 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:07:28,183 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (< |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse0 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse1 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (not .cse0) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse1) .cse2) (or (< |c_ULTIMATE.start_gcd_test_~b#1| .cse1) .cse2 (let ((.cse3 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (and (or (not (= (mod .cse3 256) 0)) (and (<= .cse4 0) (not (= .cse3 0)))) (or (not (= (mod (+ .cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 0)) (< 0 .cse4))))) (let ((.cse11 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse5 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse12 (<= .cse1 0)) (.cse10 (<= .cse11 127)) (.cse9 (<= 128 .cse11)) (.cse8 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse6 (+ .cse11 (- 256)))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))) .cse5) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) .cse5) (and (or (and (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (= (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (let ((.cse7 (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= .cse7 0)) (= (mod (+ .cse7 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_24|)) 256) .cse8))))) .cse9) (and .cse10 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse11 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) .cse12) (and .cse12 (or (and .cse10 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse11 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) (and .cse9 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (let ((.cse13 (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= (mod (+ .cse13 |v_ULTIMATE.start_gcd_test_~b#1_24|) 256) .cse8) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (not (= .cse13 0))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (= (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0))) .cse0)))))))))) is different from true [2024-11-09 06:07:30,729 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse5 (<= .cse6 0)) (.cse4 (<= 128 .cse2)) (.cse3 (+ .cse2 (- 256))) (.cse1 (<= .cse2 127))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) .cse0) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))) .cse0) (and (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (= (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0))) .cse4)) .cse5) (and .cse5 (or (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (= (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))))))))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| .cse6) (< |c_ULTIMATE.start_main1_~x~0#1| 1)))) is different from true [2024-11-09 06:07:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:07:34,266 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-11-09 06:07:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:07:34,267 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 06:07:34,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:07:34,268 INFO L225 Difference]: With dead ends: 34 [2024-11-09 06:07:34,268 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 06:07:34,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=56, Invalid=198, Unknown=6, NotChecked=160, Total=420 [2024-11-09 06:07:34,270 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:07:34,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 129 Unchecked, 0.5s Time] [2024-11-09 06:07:34,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 06:07:34,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 06:07:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 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-09 06:07:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-09 06:07:34,282 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 9 [2024-11-09 06:07:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:07:34,282 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-09 06:07:34,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:07:34,283 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-11-09 06:07:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 06:07:34,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:07:34,284 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:07:34,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:07:34,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:07:34,489 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:07:34,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:07:34,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1228259416, now seen corresponding path program 1 times [2024-11-09 06:07:34,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:07:34,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367481089] [2024-11-09 06:07:34,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:07:34,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:07:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:07:34,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:07:34,569 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:07:34,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367481089] [2024-11-09 06:07:34,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367481089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:07:34,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:07:34,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:07:34,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233639542] [2024-11-09 06:07:34,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:07:34,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:07:34,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:07:34,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:07:34,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:07:34,572 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-09 06:07:34,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:07:34,677 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-11-09 06:07:34,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:07:34,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-09 06:07:34,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:07:34,679 INFO L225 Difference]: With dead ends: 32 [2024-11-09 06:07:34,680 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 06:07:34,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:07:34,682 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:07:34,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:07:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 06:07:34,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 06:07:34,691 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-09 06:07:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-09 06:07:34,692 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2024-11-09 06:07:34,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:07:34,693 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-09 06:07:34,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-09 06:07:34,693 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-09 06:07:34,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:07:34,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:07:34,695 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:07:34,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:07:34,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:07:34,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:07:34,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1850413146, now seen corresponding path program 2 times [2024-11-09 06:07:34,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:07:34,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710585866] [2024-11-09 06:07:34,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:07:34,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:07:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 06:07:34,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1874287741] [2024-11-09 06:07:34,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:07:34,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:07:34,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:07:34,769 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:07:34,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:07:34,858 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 06:07:34,859 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:07:34,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 06:07:34,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:07:37,423 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse8 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse7 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse4 (+ .cse2 (- 256))) (.cse5 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse3 (<= 128 .cse2)) (.cse1 (<= .cse2 127)) (.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|))) .cse0) (and (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_36|))))) (and .cse3 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_36|) 0) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0))) .cse5) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse6 (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod (+ .cse6 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) .cse7) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse6 0)))))))) .cse8) (and .cse8 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse9 (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= .cse9 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse7 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse9) 256))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_36|) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse5)) .cse3) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse0)))) is different from true [2024-11-09 06:07:38,118 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (let ((.cse7 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse5 (+ .cse7 (- 256))) (.cse2 (<= 128 .cse7)) (.cse6 (<= .cse7 127)) (.cse1 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|))) .cse0) (and .cse1 (or (and .cse2 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse3 (mod .cse5 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod (+ .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) .cse4) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse3 0)))))) (and .cse6 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse0) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse8 (mod .cse5 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= .cse8 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse4 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse8) 256))))) .cse2) (and .cse6 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) .cse1))))) is different from true [2024-11-09 06:07:44,034 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse8 (<= .cse10 127)) (.cse1 (<= 128 .cse10)) (.cse3 (+ .cse10 (- 256))) (.cse5 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse4 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse25 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and .cse1 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse2 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse2 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse2 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse7 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= .cse5 (mod (+ .cse6 .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256)) (not (= .cse6 0)) (not (= .cse7 0)))))))) (and .cse8 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse9 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse9) 0) (not (= .cse9 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse12 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse12))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse11 0)) (= (mod (+ (* 255 .cse12) .cse11) 256) .cse5) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse12 0)))))))))) (and .cse0 (or (and .cse8 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse13 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse13)) (not (= .cse13 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse15 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse15))) (and (not (= .cse14 0)) (= (mod (+ (* 255 .cse15) .cse14) 256) .cse5) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse15 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse16 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse16) 0) (not (= .cse16 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse4))) (and .cse1 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (.cse18 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ .cse19 .cse18) 256))))) (and (not (= .cse17 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse18 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod (+ .cse17 .cse19 .cse18) 256) .cse5))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse20 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse20) 256))) 0) (not (= .cse20 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse21 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse21) 256))) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse21 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse23 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse23))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse22 0)) (= (mod (+ (* .cse23 255) .cse22) 256) .cse5) (not (= .cse23 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)))))) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse24 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse24 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse24) 0)))))) .cse25) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse27 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse27))) (and (not (= .cse26 0)) (= (mod (+ (* .cse27 255) .cse26) 256) .cse5) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse27 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse28 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse28) 0)))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse29 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse29) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) .cse25)))) is different from true [2024-11-09 06:07:47,931 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse15 (+ .cse8 (- 256))) (.cse12 (<= 128 .cse8)) (.cse11 (<= .cse8 127)) (.cse17 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse2 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse2 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse2) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse5 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse5))) (and (not (= .cse3 0)) (= .cse4 (mod (+ (* .cse5 255) .cse3) 256)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse5 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse6 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse6 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse6) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) (and (or (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse7 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse7) 0) (not (= .cse7 0))))) .cse1) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse10 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse10))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse9 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse10 0)) (= .cse4 (mod (+ (* 255 .cse10) .cse9) 256))))))) .cse11) (and .cse12 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse14 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse14 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= .cse4 (mod (+ .cse13 .cse14 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse13 0)) (not (= .cse14 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse16 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse16 0))))) .cse1)))) .cse17) (and (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse18 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse18 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse18) 256))) |c_ULTIMATE.start_gcd_test_~a#1|)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse20 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (.cse21 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ .cse20 .cse21) 256))))) (and (= .cse4 (mod (+ .cse19 .cse20 .cse21) 256)) (not (= .cse19 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse21 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse22 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse22) 256))) 0) (not (= .cse22 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) .cse12) (and .cse11 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse24 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse24))) (and (not (= .cse23 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse24 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse4 (mod (+ (* 255 .cse24) .cse23) 256)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse25 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse25 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse25)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse26 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse26) 0) (not (= .cse26 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse1)))) .cse17) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse28))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse27 0)) (= .cse4 (mod (+ (* .cse28 255) .cse27) 256)) (not (= .cse28 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)))))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse29 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse29) 0)))))) .cse0)))) is different from true [2024-11-09 06:07:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-09 06:07:56,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:08:26,510 WARN L286 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 86 DAG size of output: 82 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:08:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:08:40,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:08:40,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710585866] [2024-11-09 06:08:40,831 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 06:08:40,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874287741] [2024-11-09 06:08:40,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874287741] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:08:40,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [182757752] [2024-11-09 06:08:40,835 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 06:08:40,836 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:08:40,836 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:08:40,836 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:08:40,836 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:08:41,223 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:08:43,134 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '451#(<= 1 |#StackHeapBarrier|)' at error location [2024-11-09 06:08:43,134 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:08:43,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:08:43,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-11-09 06:08:43,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729199897] [2024-11-09 06:08:43,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:08:43,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 06:08:43,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:08:43,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 06:08:43,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=252, Unknown=12, NotChecked=140, Total=462 [2024-11-09 06:08:43,137 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:08:43,490 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse36 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse13 (mod (+ .cse36 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse1 (mod .cse36 256))) (let ((.cse15 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse11 (< 127 .cse1)) (.cse4 (= .cse36 0)) (.cse12 (< .cse1 128)) (.cse3 (< 127 .cse13)) (.cse10 (< 127 .cse14)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse7 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse2 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse16 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (let ((.cse8 (< .cse14 .cse2)) (.cse9 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse6 (< .cse13 .cse2))) (and (or (and (or .cse0 (< .cse1 .cse2)) (or .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse4 .cse8 .cse9 .cse10 .cse7)) .cse11) (or .cse12 (and (or .cse8 .cse9 .cse10 .cse7) (or .cse3 .cse5 .cse6 .cse7))))) .cse15 .cse16) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse2) .cse16) (let ((.cse19 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse24 (<= .cse2 0)) (.cse23 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse21 (+ .cse19 (- 256))) (.cse20 (<= 128 .cse19)) (.cse18 (<= .cse19 127)) (.cse17 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|))) .cse17) (and (or (and .cse18 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse19 |v_ULTIMATE.start_gcd_test_~b#1_36|))))) (and .cse20 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|) 0) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0))) .cse15) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse22 (mod .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod (+ .cse22 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) .cse23) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse22 0)))))))) .cse24) (and .cse24 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse25 (mod .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= .cse25 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse23 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse25) 256))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse15)) .cse20) (and .cse18 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse19 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse17)))) (or (let ((.cse27 (= .cse13 0)) (.cse28 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse13) .cse2) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))))) (let ((.cse30 (or .cse27 .cse7 .cse28)) (.cse31 (< .cse13 128)) (.cse29 (< .cse14 128)) (.cse32 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0) (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse13)) .cse2))))) (and (or .cse11 (let ((.cse26 (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse1) .cse2) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse1 0)))) (and (or .cse3 (and (or (and .cse26 (or .cse4 .cse27 .cse7 .cse28)) .cse29) (or (and .cse26 .cse30) .cse10))) (or .cse31 (and (or .cse4 .cse32 .cse7) .cse26))))) (or .cse12 (let ((.cse34 (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse1)) .cse2) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0)))))) (and (or .cse3 (let ((.cse33 (and .cse30 .cse34))) (and (or .cse10 .cse33) (or .cse29 .cse33)))) (or .cse31 (let ((.cse35 (and (or .cse32 .cse7) .cse34))) (and (or .cse29 .cse35) (or .cse10 .cse35)))))))))) .cse16))))) is different from false [2024-11-09 06:08:46,480 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse35 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod (+ .cse35 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse30 (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse24 (mod .cse35 256))) (let ((.cse23 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse14 (= .cse35 0)) (.cse11 (< 127 .cse24)) (.cse25 (< .cse24 128)) (.cse20 (< 127 .cse30)) (.cse12 (< 127 .cse29)) (.cse16 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse1 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse0) .cse1) (let ((.cse9 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse2 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse6 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse7 (+ .cse9 (- 256))) (.cse4 (<= 128 .cse9)) (.cse8 (<= .cse9 127)) (.cse3 (<= .cse0 0))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|))) .cse2) (and .cse3 (or (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse5 (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod (+ .cse5 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) .cse6) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse5 0)))))) (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_36|))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse2) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse10 (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= .cse10 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse6 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse10) 256))))) .cse4) (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) .cse3)))) (or (let ((.cse15 (= .cse29 0)) (.cse17 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse29) .cse0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))))) (let ((.cse19 (or .cse15 .cse16 .cse17)) (.cse21 (< .cse29 128)) (.cse18 (< .cse30 128)) (.cse22 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0) (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse29)) .cse0))))) (and (or .cse11 (let ((.cse13 (or .cse23 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse24) .cse0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse24 0)))) (and (or .cse12 (and (or (and .cse13 (or .cse14 .cse15 .cse16 .cse17)) .cse18) (or (and .cse13 .cse19) .cse20))) (or .cse21 (and (or .cse14 .cse22 .cse16) .cse13))))) (or .cse25 (let ((.cse27 (or .cse23 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse24)) .cse0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0)))))) (and (or .cse12 (let ((.cse26 (and .cse19 .cse27))) (and (or .cse20 .cse26) (or .cse18 .cse26)))) (or .cse21 (let ((.cse28 (and (or .cse22 .cse16) .cse27))) (and (or .cse18 .cse28) (or .cse20 .cse28)))))))))) .cse1) (or (let ((.cse33 (< .cse30 .cse0)) (.cse34 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse31 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse32 (< .cse29 .cse0))) (and (or (and (or .cse23 (< .cse24 .cse0)) (or .cse12 .cse14 .cse31 .cse32 .cse16) (or .cse14 .cse33 .cse34 .cse20 .cse16)) .cse11) (or .cse25 (and (or .cse33 .cse34 .cse20 .cse16) (or .cse12 .cse31 .cse32 .cse16))))) .cse1))))) is different from false [2024-11-09 06:08:49,937 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse35 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod (+ .cse35 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse30 (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse24 (mod .cse35 256))) (let ((.cse23 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse14 (= .cse35 0)) (.cse11 (< 127 .cse24)) (.cse25 (< .cse24 128)) (.cse20 (< 127 .cse30)) (.cse12 (< 127 .cse29)) (.cse16 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse1 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse0) .cse1) (let ((.cse9 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse2 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse6 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse7 (+ .cse9 (- 256))) (.cse4 (<= 128 .cse9)) (.cse8 (<= .cse9 127)) (.cse3 (<= .cse0 0))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|))) .cse2) (and .cse3 (or (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse5 (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod (+ .cse5 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) .cse6) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse5 0)))))) (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_36|))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse2) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse10 (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= .cse10 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse6 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse10) 256))))) .cse4) (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) .cse3)))) (or (let ((.cse15 (= .cse29 0)) (.cse17 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse29) .cse0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))))) (let ((.cse19 (or .cse15 .cse16 .cse17)) (.cse21 (< .cse29 128)) (.cse18 (< .cse30 128)) (.cse22 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0) (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse29)) .cse0))))) (and (or .cse11 (let ((.cse13 (or .cse23 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse24) .cse0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse24 0)))) (and (or .cse12 (and (or (and .cse13 (or .cse14 .cse15 .cse16 .cse17)) .cse18) (or (and .cse13 .cse19) .cse20))) (or .cse21 (and (or .cse14 .cse22 .cse16) .cse13))))) (or .cse25 (let ((.cse27 (or .cse23 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse24)) .cse0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0)))))) (and (or .cse12 (let ((.cse26 (and .cse19 .cse27))) (and (or .cse20 .cse26) (or .cse18 .cse26)))) (or .cse21 (let ((.cse28 (and (or .cse22 .cse16) .cse27))) (and (or .cse18 .cse28) (or .cse20 .cse28)))))))))) .cse1) (or (let ((.cse33 (< .cse30 .cse0)) (.cse34 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse31 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse32 (< .cse29 .cse0))) (and (or (and (or .cse23 (< .cse24 .cse0)) (or .cse12 .cse14 .cse31 .cse32 .cse16) (or .cse14 .cse33 .cse34 .cse20 .cse16)) .cse11) (or .cse25 (and (or .cse33 .cse34 .cse20 .cse16) (or .cse12 .cse31 .cse32 .cse16))))) .cse1))))) is different from true [2024-11-09 06:08:57,307 WARN L286 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 172 DAG size of output: 137 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:08:57,650 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse56 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse50 (mod (+ .cse56 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse51 (mod (+ .cse56 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse45 (mod .cse56 256))) (let ((.cse44 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse35 (= .cse56 0)) (.cse32 (< 127 .cse45)) (.cse46 (< .cse45 128)) (.cse41 (< 127 .cse51)) (.cse33 (< 127 .cse50)) (.cse37 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse30 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse31 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (let ((.cse10 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= .cse30 0)) (.cse8 (<= .cse10 127)) (.cse1 (<= 128 .cse10)) (.cse3 (+ .cse10 (- 256))) (.cse5 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse4 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse25 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and .cse1 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse2 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse2 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse2 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse7 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= .cse5 (mod (+ .cse6 .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256)) (not (= .cse6 0)) (not (= .cse7 0)))))))) (and .cse8 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse9 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse9) 0) (not (= .cse9 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse12 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse12))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse11 0)) (= (mod (+ (* 255 .cse12) .cse11) 256) .cse5) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse12 0)))))))))) (and .cse0 (or (and .cse8 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse13 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse13)) (not (= .cse13 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse15 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse15))) (and (not (= .cse14 0)) (= (mod (+ (* 255 .cse15) .cse14) 256) .cse5) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse15 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse16 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse16) 0) (not (= .cse16 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse4))) (and .cse1 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (.cse18 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ .cse19 .cse18) 256))))) (and (not (= .cse17 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse18 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod (+ .cse17 .cse19 .cse18) 256) .cse5))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse20 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse20) 256))) 0) (not (= .cse20 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse21 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse21) 256))) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse21 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse23 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse23))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse22 0)) (= (mod (+ (* .cse23 255) .cse22) 256) .cse5) (not (= .cse23 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)))))) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse24 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse24 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse24) 0)))))) .cse25) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse27 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse27))) (and (not (= .cse26 0)) (= (mod (+ (* .cse27 255) .cse26) 256) .cse5) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse27 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse28 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse28) 0)))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse29 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse29) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) .cse25)))) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse30) .cse31) (or (let ((.cse36 (= .cse50 0)) (.cse38 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse50) .cse30) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))))) (let ((.cse40 (or .cse36 .cse37 .cse38)) (.cse42 (< .cse50 128)) (.cse39 (< .cse51 128)) (.cse43 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0) (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse50)) .cse30))))) (and (or .cse32 (let ((.cse34 (or .cse44 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse45) .cse30) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse45 0)))) (and (or .cse33 (and (or (and .cse34 (or .cse35 .cse36 .cse37 .cse38)) .cse39) (or (and .cse34 .cse40) .cse41))) (or .cse42 (and (or .cse35 .cse43 .cse37) .cse34))))) (or .cse46 (let ((.cse48 (or .cse44 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse45)) .cse30) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0)))))) (and (or .cse33 (let ((.cse47 (and .cse40 .cse48))) (and (or .cse41 .cse47) (or .cse39 .cse47)))) (or .cse42 (let ((.cse49 (and (or .cse43 .cse37) .cse48))) (and (or .cse39 .cse49) (or .cse41 .cse49)))))))))) .cse31) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse30) .cse31) (or (let ((.cse54 (< .cse51 .cse30)) (.cse55 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse52 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse53 (< .cse50 .cse30))) (and (or (and (or .cse44 (< .cse45 .cse30)) (or .cse33 .cse35 .cse52 .cse53 .cse37) (or .cse35 .cse54 .cse55 .cse41 .cse37)) .cse32) (or .cse46 (and (or .cse54 .cse55 .cse41 .cse37) (or .cse33 .cse52 .cse53 .cse37))))) .cse31))))) is different from false [2024-11-09 06:08:57,669 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse56 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse50 (mod (+ .cse56 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse51 (mod (+ .cse56 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse45 (mod .cse56 256))) (let ((.cse44 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse35 (= .cse56 0)) (.cse32 (< 127 .cse45)) (.cse46 (< .cse45 128)) (.cse41 (< 127 .cse51)) (.cse33 (< 127 .cse50)) (.cse37 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse30 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse31 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (let ((.cse10 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= .cse30 0)) (.cse8 (<= .cse10 127)) (.cse1 (<= 128 .cse10)) (.cse3 (+ .cse10 (- 256))) (.cse5 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse4 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse25 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and .cse1 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse2 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse2 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse2 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse7 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= .cse5 (mod (+ .cse6 .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256)) (not (= .cse6 0)) (not (= .cse7 0)))))))) (and .cse8 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse9 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse9) 0) (not (= .cse9 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse12 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse12))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse11 0)) (= (mod (+ (* 255 .cse12) .cse11) 256) .cse5) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse12 0)))))))))) (and .cse0 (or (and .cse8 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse13 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse13)) (not (= .cse13 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse15 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse15))) (and (not (= .cse14 0)) (= (mod (+ (* 255 .cse15) .cse14) 256) .cse5) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse15 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse16 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse16) 0) (not (= .cse16 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse4))) (and .cse1 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (.cse18 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ .cse19 .cse18) 256))))) (and (not (= .cse17 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse18 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod (+ .cse17 .cse19 .cse18) 256) .cse5))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse20 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse20) 256))) 0) (not (= .cse20 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse21 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse21) 256))) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse21 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse23 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse23))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse22 0)) (= (mod (+ (* .cse23 255) .cse22) 256) .cse5) (not (= .cse23 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)))))) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse24 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse24 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse24) 0)))))) .cse25) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse27 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse27))) (and (not (= .cse26 0)) (= (mod (+ (* .cse27 255) .cse26) 256) .cse5) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse27 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse28 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse28) 0)))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse29 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse29) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) .cse25)))) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse30) .cse31) (or (let ((.cse36 (= .cse50 0)) (.cse38 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse50) .cse30) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))))) (let ((.cse40 (or .cse36 .cse37 .cse38)) (.cse42 (< .cse50 128)) (.cse39 (< .cse51 128)) (.cse43 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0) (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse50)) .cse30))))) (and (or .cse32 (let ((.cse34 (or .cse44 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse45) .cse30) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse45 0)))) (and (or .cse33 (and (or (and .cse34 (or .cse35 .cse36 .cse37 .cse38)) .cse39) (or (and .cse34 .cse40) .cse41))) (or .cse42 (and (or .cse35 .cse43 .cse37) .cse34))))) (or .cse46 (let ((.cse48 (or .cse44 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse45)) .cse30) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0)))))) (and (or .cse33 (let ((.cse47 (and .cse40 .cse48))) (and (or .cse41 .cse47) (or .cse39 .cse47)))) (or .cse42 (let ((.cse49 (and (or .cse43 .cse37) .cse48))) (and (or .cse39 .cse49) (or .cse41 .cse49)))))))))) .cse31) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse30) .cse31) (or (let ((.cse54 (< .cse51 .cse30)) (.cse55 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse52 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse53 (< .cse50 .cse30))) (and (or (and (or .cse44 (< .cse45 .cse30)) (or .cse33 .cse35 .cse52 .cse53 .cse37) (or .cse35 .cse54 .cse55 .cse41 .cse37)) .cse32) (or .cse46 (and (or .cse54 .cse55 .cse41 .cse37) (or .cse33 .cse52 .cse53 .cse37))))) .cse31))))) is different from true [2024-11-09 06:09:05,883 WARN L286 SmtUtils]: Spent 5.87s on a formula simplification. DAG size of input: 173 DAG size of output: 137 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:09:16,992 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse56 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse44 (mod (+ .cse56 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse43 (mod (+ .cse56 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse32 (mod .cse56 256))) (let ((.cse41 (< 127 .cse32)) (.cse34 (= .cse56 0)) (.cse42 (< .cse32 128)) (.cse33 (< 127 .cse43)) (.cse40 (< 127 .cse44)) (.cse31 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse37 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse30 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse45 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (let ((.cse8 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse15 (+ .cse8 (- 256))) (.cse12 (<= 128 .cse8)) (.cse11 (<= .cse8 127)) (.cse17 (<= .cse30 0)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse2 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse2 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse2) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse5 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse5))) (and (not (= .cse3 0)) (= .cse4 (mod (+ (* .cse5 255) .cse3) 256)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse5 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse6 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse6 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse6) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) (and (or (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse7 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse7) 0) (not (= .cse7 0))))) .cse1) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse10 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse10))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse9 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse10 0)) (= .cse4 (mod (+ (* 255 .cse10) .cse9) 256))))))) .cse11) (and .cse12 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse14 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse14 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= .cse4 (mod (+ .cse13 .cse14 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse13 0)) (not (= .cse14 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse16 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse16 0))))) .cse1)))) .cse17) (and (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse18 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse18 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse18) 256))) |c_ULTIMATE.start_gcd_test_~a#1|)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse20 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (.cse21 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ .cse20 .cse21) 256))))) (and (= .cse4 (mod (+ .cse19 .cse20 .cse21) 256)) (not (= .cse19 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse21 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse22 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse22) 256))) 0) (not (= .cse22 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) .cse12) (and .cse11 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse24 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse24))) (and (not (= .cse23 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse24 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse4 (mod (+ (* 255 .cse24) .cse23) 256)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse25 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse25 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse25)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse26 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse26) 0) (not (= .cse26 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse1)))) .cse17) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse28))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse27 0)) (= .cse4 (mod (+ (* .cse28 255) .cse27) 256)) (not (= .cse28 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)))))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse29 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse29) 0)))))) .cse0)))) (or (let ((.cse38 (< .cse44 .cse30)) (.cse39 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse35 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse36 (< .cse43 .cse30))) (and (or (and (or .cse31 (< .cse32 .cse30)) (or .cse33 .cse34 .cse35 .cse36 .cse37) (or .cse34 .cse38 .cse39 .cse40 .cse37)) .cse41) (or .cse42 (and (or .cse38 .cse39 .cse40 .cse37) (or .cse33 .cse35 .cse36 .cse37))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) .cse45) (or (let ((.cse47 (= .cse43 0)) (.cse48 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse43) .cse30) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))))) (let ((.cse50 (or .cse47 .cse37 .cse48)) (.cse51 (< .cse43 128)) (.cse49 (< .cse44 128)) (.cse52 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0) (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse43)) .cse30))))) (and (or .cse41 (let ((.cse46 (or .cse31 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse32) .cse30) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse32 0)))) (and (or .cse33 (and (or (and .cse46 (or .cse34 .cse47 .cse37 .cse48)) .cse49) (or (and .cse46 .cse50) .cse40))) (or .cse51 (and (or .cse34 .cse52 .cse37) .cse46))))) (or .cse42 (let ((.cse54 (or .cse31 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse32)) .cse30) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0)))))) (and (or .cse33 (let ((.cse53 (and .cse50 .cse54))) (and (or .cse40 .cse53) (or .cse49 .cse53)))) (or .cse51 (let ((.cse55 (and (or .cse52 .cse37) .cse54))) (and (or .cse49 .cse55) (or .cse40 .cse55)))))))))) .cse45) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse30) .cse45))))) is different from false [2024-11-09 06:09:17,019 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse56 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse44 (mod (+ .cse56 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse43 (mod (+ .cse56 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse32 (mod .cse56 256))) (let ((.cse41 (< 127 .cse32)) (.cse34 (= .cse56 0)) (.cse42 (< .cse32 128)) (.cse33 (< 127 .cse43)) (.cse40 (< 127 .cse44)) (.cse31 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse37 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse30 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse45 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (let ((.cse8 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse15 (+ .cse8 (- 256))) (.cse12 (<= 128 .cse8)) (.cse11 (<= .cse8 127)) (.cse17 (<= .cse30 0)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse2 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse2 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse2) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse5 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse5))) (and (not (= .cse3 0)) (= .cse4 (mod (+ (* .cse5 255) .cse3) 256)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse5 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse6 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse6 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse6) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) (and (or (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse7 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse7) 0) (not (= .cse7 0))))) .cse1) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse10 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse10))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse9 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse10 0)) (= .cse4 (mod (+ (* 255 .cse10) .cse9) 256))))))) .cse11) (and .cse12 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse14 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse14 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= .cse4 (mod (+ .cse13 .cse14 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse13 0)) (not (= .cse14 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse16 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse16 0))))) .cse1)))) .cse17) (and (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse18 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse18 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse18) 256))) |c_ULTIMATE.start_gcd_test_~a#1|)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse20 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (.cse21 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ .cse20 .cse21) 256))))) (and (= .cse4 (mod (+ .cse19 .cse20 .cse21) 256)) (not (= .cse19 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse21 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse22 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse22) 256))) 0) (not (= .cse22 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) .cse12) (and .cse11 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse24 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse24))) (and (not (= .cse23 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse24 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse4 (mod (+ (* 255 .cse24) .cse23) 256)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse25 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse25 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse25)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse26 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse26) 0) (not (= .cse26 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse1)))) .cse17) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse28))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse27 0)) (= .cse4 (mod (+ (* .cse28 255) .cse27) 256)) (not (= .cse28 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)))))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse29 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse29) 0)))))) .cse0)))) (or (let ((.cse38 (< .cse44 .cse30)) (.cse39 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse35 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse36 (< .cse43 .cse30))) (and (or (and (or .cse31 (< .cse32 .cse30)) (or .cse33 .cse34 .cse35 .cse36 .cse37) (or .cse34 .cse38 .cse39 .cse40 .cse37)) .cse41) (or .cse42 (and (or .cse38 .cse39 .cse40 .cse37) (or .cse33 .cse35 .cse36 .cse37))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) .cse45) (or (let ((.cse47 (= .cse43 0)) (.cse48 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse43) .cse30) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))))) (let ((.cse50 (or .cse47 .cse37 .cse48)) (.cse51 (< .cse43 128)) (.cse49 (< .cse44 128)) (.cse52 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0) (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse43)) .cse30))))) (and (or .cse41 (let ((.cse46 (or .cse31 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse32) .cse30) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse32 0)))) (and (or .cse33 (and (or (and .cse46 (or .cse34 .cse47 .cse37 .cse48)) .cse49) (or (and .cse46 .cse50) .cse40))) (or .cse51 (and (or .cse34 .cse52 .cse37) .cse46))))) (or .cse42 (let ((.cse54 (or .cse31 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse32)) .cse30) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0)))))) (and (or .cse33 (let ((.cse53 (and .cse50 .cse54))) (and (or .cse40 .cse53) (or .cse49 .cse53)))) (or .cse51 (let ((.cse55 (and (or .cse52 .cse37) .cse54))) (and (or .cse49 .cse55) (or .cse40 .cse55)))))))))) .cse45) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse30) .cse45))))) is different from true [2024-11-09 06:09:19,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:09:21,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:09:45,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:09:47,410 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 [1] [2024-11-09 06:09:49,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:09:52,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:09:54,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:09:57,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:09:59,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:10:01,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:10:03,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:10:06,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-09 06:10:08,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:10:46,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:10:48,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:10:50,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:10:53,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:10:55,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:10:57,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:10:57,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:10:57,644 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2024-11-09 06:10:57,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 06:10:57,645 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 06:10:57,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:10:57,646 INFO L225 Difference]: With dead ends: 43 [2024-11-09 06:10:57,646 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 06:10:57,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 122.1s TimeCoverageRelationStatistics Valid=136, Invalid=551, Unknown=47, NotChecked=456, Total=1190 [2024-11-09 06:10:57,648 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 45.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:10:57,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 111 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 19 Unknown, 211 Unchecked, 45.9s Time] [2024-11-09 06:10:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 06:10:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-09 06:10:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 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-09 06:10:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-11-09 06:10:57,673 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 13 [2024-11-09 06:10:57,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:10:57,674 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-11-09 06:10:57,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:10:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-11-09 06:10:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 06:10:57,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:10:57,675 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:10:57,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:10:57,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:10:57,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:10:57,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:10:57,877 INFO L85 PathProgramCache]: Analyzing trace with hash 235847532, now seen corresponding path program 1 times [2024-11-09 06:10:57,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:10:57,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788084795] [2024-11-09 06:10:57,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:10:57,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:10:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:10:57,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:10:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:10:57,921 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 06:10:57,922 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:10:57,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-09 06:10:57,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-09 06:10:57,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:10:57,930 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-11-09 06:10:57,956 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:10:57,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:10:57 BoogieIcfgContainer [2024-11-09 06:10:57,963 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:10:57,963 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:10:57,964 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:10:57,964 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:10:57,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:07:18" (3/4) ... [2024-11-09 06:10:57,968 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 06:10:57,972 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:10:57,973 INFO L158 Benchmark]: Toolchain (without parser) took 220886.78ms. Allocated memory was 144.7MB in the beginning and 211.8MB in the end (delta: 67.1MB). Free memory was 100.9MB in the beginning and 166.9MB in the end (delta: -66.0MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2024-11-09 06:10:57,973 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 144.7MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:10:57,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.35ms. Allocated memory is still 144.7MB. Free memory was 100.9MB in the beginning and 86.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 06:10:57,974 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.28ms. Allocated memory is still 144.7MB. Free memory was 86.9MB in the beginning and 85.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:10:57,974 INFO L158 Benchmark]: Boogie Preprocessor took 30.97ms. Allocated memory is still 144.7MB. Free memory was 85.3MB in the beginning and 83.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:10:57,975 INFO L158 Benchmark]: RCFGBuilder took 568.99ms. Allocated memory is still 144.7MB. Free memory was 83.9MB in the beginning and 66.4MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 06:10:57,975 INFO L158 Benchmark]: TraceAbstraction took 219866.61ms. Allocated memory was 144.7MB in the beginning and 211.8MB in the end (delta: 67.1MB). Free memory was 65.7MB in the beginning and 168.0MB in the end (delta: -102.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:10:57,975 INFO L158 Benchmark]: Witness Printer took 8.86ms. Allocated memory is still 211.8MB. Free memory was 168.0MB in the beginning and 166.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:10:57,977 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 144.7MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.35ms. Allocated memory is still 144.7MB. Free memory was 100.9MB in the beginning and 86.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.28ms. Allocated memory is still 144.7MB. Free memory was 86.9MB in the beginning and 85.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.97ms. Allocated memory is still 144.7MB. Free memory was 85.3MB in the beginning and 83.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 568.99ms. Allocated memory is still 144.7MB. Free memory was 83.9MB in the beginning and 66.4MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 219866.61ms. Allocated memory was 144.7MB in the beginning and 211.8MB in the end (delta: 67.1MB). Free memory was 65.7MB in the beginning and 168.0MB in the end (delta: -102.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 8.86ms. Allocated memory is still 211.8MB. Free memory was 168.0MB in the beginning and 166.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 102]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryArithmeticFLOAToperation at line 95. Possible FailurePath: [L108] COND FALSE !(__VERIFIER_nondet_int()) [L111] CALL main2() [L90] float IN = __VERIFIER_nondet_float(); [L91] CALL assume_abort_if_not(IN > -1.2f && IN < 1.2f) [L75] COND FALSE !(!cond) [L91] RET assume_abort_if_not(IN > -1.2f && IN < 1.2f) [L93] CALL, EXPR f(IN) VAL [\old(x)=109] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; [L93] RET, EXPR f(IN) VAL [IN=109] [L93] CALL, EXPR fp(IN) VAL [\old(x)=109] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; [L93] RET, EXPR fp(IN) VAL [IN=109] [L93] float x = IN - f(IN)/fp(IN); [L95] CALL, EXPR f(x) VAL [\old(x)=110] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; [L95] RET, EXPR f(x) VAL [IN=109, x=110] [L95] CALL, EXPR fp(x) VAL [\old(x)=110] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; [L95] RET, EXPR fp(x) VAL [IN=109, x=110] [L95] x = x - f(x)/fp(x) [L101] COND TRUE !(x < 0.1) VAL [IN=109] [L102] reach_error() VAL [IN=109] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 27 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 219.7s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 141.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 46.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 315 SdHoareTripleChecker+Invalid, 41.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 340 IncrementalHoareTripleChecker+Unchecked, 251 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 244 IncrementalHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 64 mSDtfsCounter, 244 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 131.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=4, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 73.3s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 55 ConstructedInterpolants, 12 QuantifiedInterpolants, 7303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2/22 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 06:10:58,194 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-09 06:10:58,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_6.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje --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 3d09a4cc0bc23b63ede1d1b9d8e202055edfb550f267c616041c6cb452339e6a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:11:00,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:11:00,902 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 06:11:00,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:11:00,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:11:00,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:11:00,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:11:00,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:11:00,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:11:00,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:11:00,959 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:11:00,959 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:11:00,960 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:11:00,960 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:11:00,961 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:11:00,961 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:11:00,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:11:00,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:11:00,963 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:11:00,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:11:00,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:11:00,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:11:00,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:11:00,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:11:00,966 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:11:00,967 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 06:11:00,967 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:11:00,967 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 06:11:00,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:11:00,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:11:00,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:11:00,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:11:00,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:11:00,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:11:00,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:11:00,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:11:00,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:11:00,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:11:00,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:11:00,973 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 06:11:00,973 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 06:11:00,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:11:00,974 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:11:00,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje 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 -> 3d09a4cc0bc23b63ede1d1b9d8e202055edfb550f267c616041c6cb452339e6a [2024-11-09 06:11:01,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:11:01,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:11:01,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:11:01,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:11:01,459 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:11:01,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/combinations/gcd_3+newton_2_6.i Unable to find full path for "g++" [2024-11-09 06:11:03,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:11:03,832 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:11:03,833 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i [2024-11-09 06:11:03,842 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/data/f5576e097/2bd5f31c8fae48da8564d249b5cd11d5/FLAG49ac9acfc [2024-11-09 06:11:04,196 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/data/f5576e097/2bd5f31c8fae48da8564d249b5cd11d5 [2024-11-09 06:11:04,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:11:04,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:11:04,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:11:04,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:11:04,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:11:04,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:11:04" (1/1) ... [2024-11-09 06:11:04,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@559eb55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:04, skipping insertion in model container [2024-11-09 06:11:04,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:11:04" (1/1) ... [2024-11-09 06:11:04,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:11:04,549 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_03fa5a75-d503-4735-bae5-612881a90a32/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i[1226,1239] [2024-11-09 06:11:04,588 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_03fa5a75-d503-4735-bae5-612881a90a32/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i[2841,2854] [2024-11-09 06:11:04,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:11:04,620 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:11:04,656 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_03fa5a75-d503-4735-bae5-612881a90a32/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i[1226,1239] [2024-11-09 06:11:04,692 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_03fa5a75-d503-4735-bae5-612881a90a32/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i[2841,2854] [2024-11-09 06:11:04,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:11:04,746 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:11:04,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:04 WrapperNode [2024-11-09 06:11:04,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:11:04,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:11:04,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:11:04,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:11:04,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:04" (1/1) ... [2024-11-09 06:11:04,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:04" (1/1) ... [2024-11-09 06:11:04,833 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2024-11-09 06:11:04,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:11:04,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:11:04,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:11:04,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:11:04,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:04" (1/1) ... [2024-11-09 06:11:04,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:04" (1/1) ... [2024-11-09 06:11:04,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:04" (1/1) ... [2024-11-09 06:11:04,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:04" (1/1) ... [2024-11-09 06:11:04,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:04" (1/1) ... [2024-11-09 06:11:04,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:04" (1/1) ... [2024-11-09 06:11:04,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:04" (1/1) ... [2024-11-09 06:11:04,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:04" (1/1) ... [2024-11-09 06:11:04,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:11:04,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:11:04,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:11:04,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:11:04,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:04" (1/1) ... [2024-11-09 06:11:04,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:11:04,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:11:04,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:11:04,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:11:04,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:11:04,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 06:11:04,977 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-09 06:11:04,978 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-09 06:11:04,978 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-09 06:11:04,980 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-09 06:11:04,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:11:04,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:11:05,100 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:11:05,103 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:11:13,936 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-09 06:11:13,937 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:11:13,955 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:11:13,956 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:11:13,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:11:13 BoogieIcfgContainer [2024-11-09 06:11:13,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:11:13,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:11:13,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:11:13,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:11:13,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:11:04" (1/3) ... [2024-11-09 06:11:13,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@812c862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:11:13, skipping insertion in model container [2024-11-09 06:11:13,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:11:04" (2/3) ... [2024-11-09 06:11:13,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@812c862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:11:13, skipping insertion in model container [2024-11-09 06:11:13,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:11:13" (3/3) ... [2024-11-09 06:11:13,970 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_6.i [2024-11-09 06:11:13,994 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:11:13,994 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 06:11:14,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:11:14,122 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;@67d0cf9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:11:14,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 06:11:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 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-09 06:11:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:11:14,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:14,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:11:14,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:11:14,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:14,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1594868719, now seen corresponding path program 1 times [2024-11-09 06:11:14,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:11:14,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135239673] [2024-11-09 06:11:14,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:14,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:11:14,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:11:14,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:11:14,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 06:11:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:14,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:11:14,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:14,525 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-09 06:11:14,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:11:14,527 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:11:14,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135239673] [2024-11-09 06:11:14,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135239673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:11:14,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:11:14,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:11:14,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882132739] [2024-11-09 06:11:14,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:11:14,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:11:14,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:11:14,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:11:14,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:11:14,566 INFO L87 Difference]: Start difference. First operand has 38 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:14,756 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2024-11-09 06:11:14,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:11:14,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 06:11:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:14,768 INFO L225 Difference]: With dead ends: 70 [2024-11-09 06:11:14,768 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 06:11:14,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:11:14,779 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:14,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:11:14,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 06:11:14,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 06:11:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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-09 06:11:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-09 06:11:14,835 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2024-11-09 06:11:14,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:14,836 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-09 06:11:14,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-09 06:11:14,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:11:14,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:14,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:11:14,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 06:11:15,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:11:15,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:11:15,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:15,046 INFO L85 PathProgramCache]: Analyzing trace with hash 180138643, now seen corresponding path program 1 times [2024-11-09 06:11:15,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:11:15,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570860051] [2024-11-09 06:11:15,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:15,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:11:15,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:11:15,053 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:11:15,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 06:11:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:15,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:11:15,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:15,366 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-09 06:11:15,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:11:15,366 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:11:15,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570860051] [2024-11-09 06:11:15,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570860051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:11:15,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:11:15,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:11:15,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805040321] [2024-11-09 06:11:15,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:11:15,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:11:15,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:11:15,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:11:15,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:11:15,372 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:15,582 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-11-09 06:11:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:11:15,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 06:11:15,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:15,584 INFO L225 Difference]: With dead ends: 46 [2024-11-09 06:11:15,584 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 06:11:15,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:11:15,586 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:15,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 95 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:11:15,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 06:11:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-11-09 06:11:15,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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-09 06:11:15,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 06:11:15,605 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2024-11-09 06:11:15,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:15,607 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 06:11:15,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 06:11:15,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:11:15,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:15,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:11:15,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 06:11:15,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:11:15,813 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:11:15,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:15,814 INFO L85 PathProgramCache]: Analyzing trace with hash -629207983, now seen corresponding path program 1 times [2024-11-09 06:11:15,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:11:15,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538151502] [2024-11-09 06:11:15,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:15,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:11:15,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:11:15,821 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:11:15,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 06:11:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:15,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:11:15,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:16,514 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-09 06:11:16,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:11:16,514 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:11:16,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538151502] [2024-11-09 06:11:16,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538151502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:11:16,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:11:16,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:11:16,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938480082] [2024-11-09 06:11:16,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:11:16,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:11:16,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:11:16,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:11:16,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:11:16,523 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:16,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:16,774 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-09 06:11:16,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:11:16,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 06:11:16,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:16,777 INFO L225 Difference]: With dead ends: 40 [2024-11-09 06:11:16,777 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 06:11:16,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:11:16,779 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:16,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:11:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 06:11:16,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-09 06:11:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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-09 06:11:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 06:11:16,787 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2024-11-09 06:11:16,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:16,788 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 06:11:16,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 06:11:16,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:11:16,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:16,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:11:16,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 06:11:16,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:11:16,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:11:16,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:16,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1552324308, now seen corresponding path program 1 times [2024-11-09 06:11:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:11:16,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564906240] [2024-11-09 06:11:16,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:16,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:11:16,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:11:16,997 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:11:17,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 06:11:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:17,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 06:11:17,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:20,981 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-09 06:11:20,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:11:30,005 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-09 06:11:30,005 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:11:30,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564906240] [2024-11-09 06:11:30,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564906240] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:11:30,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [709709735] [2024-11-09 06:11:30,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:30,007 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:11:30,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:11:30,010 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:11:30,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-09 06:11:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:30,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 06:11:30,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:31,389 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-09 06:11:31,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:11:32,235 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-09 06:11:32,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [709709735] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:11:32,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491868473] [2024-11-09 06:11:32,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:32,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:32,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:11:32,239 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:11:32,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:11:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:11:32,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 06:11:32,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:11:34,084 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-09 06:11:34,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:11:34,989 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-09 06:11:34,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491868473] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:11:34,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 06:11:34,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9, 9, 10, 10] total 18 [2024-11-09 06:11:34,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198771488] [2024-11-09 06:11:34,990 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 06:11:34,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 06:11:34,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:11:34,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 06:11:34,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-09 06:11:34,993 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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-09 06:11:38,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:11:40,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:11:41,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:11:44,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:11:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:45,212 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-11-09 06:11:45,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 06:11:45,213 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 06:11:45,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:45,214 INFO L225 Difference]: With dead ends: 48 [2024-11-09 06:11:45,214 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 06:11:45,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-09 06:11:45,216 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:45,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 289 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 118 Invalid, 2 Unknown, 0 Unchecked, 10.2s Time] [2024-11-09 06:11:45,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 06:11:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-11-09 06:11:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 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-09 06:11:45,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-09 06:11:45,228 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 13 [2024-11-09 06:11:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:45,229 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-09 06:11:45,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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-09 06:11:45,229 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-09 06:11:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:11:45,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:45,231 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:11:45,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-09 06:11:45,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 06:11:45,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 06:11:45,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:11:45,833 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:11:45,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:45,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1058982499, now seen corresponding path program 2 times [2024-11-09 06:11:45,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:11:45,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242341249] [2024-11-09 06:11:45,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:11:45,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:11:45,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:11:45,838 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:11:45,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 06:11:52,230 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:11:52,231 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:11:52,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 06:11:52,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:14:05,201 WARN L286 SmtUtils]: Spent 16.82s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:14:21,652 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~b#1_32| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_14| (_ BitVec 8))) (let ((.cse1 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~b#1_32|))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_14|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse1))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse5))))) (let ((.cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse3))))) (and (bvsgt .cse0 (_ bv0 32)) (bvslt .cse1 (_ bv0 32)) (not (bvsge .cse0 .cse2)) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse2))))))))))) is different from false [2024-11-09 06:14:23,671 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~b#1_32| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_14| (_ BitVec 8))) (let ((.cse1 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~b#1_32|))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_14|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse1))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse5))))) (let ((.cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse3))))) (and (bvsgt .cse0 (_ bv0 32)) (bvslt .cse1 (_ bv0 32)) (not (bvsge .cse0 .cse2)) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse2))))))))))) is different from true [2024-11-09 06:14:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:14:23,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:18:26,326 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_15| (_ BitVec 8))) (let ((.cse2 ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_15|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse2))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse0))))) (or (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse1))))) (not (bvslt .cse2 (_ bv0 32))) (bvsge .cse3 .cse1) (not (bvsgt .cse3 (_ bv0 32)))))))))) is different from false [2024-11-09 06:18:28,345 WARN L873 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_15| (_ BitVec 8))) (let ((.cse2 ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_15|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse2))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse0))))) (or (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse1))))) (not (bvslt .cse2 (_ bv0 32))) (bvsge .cse3 .cse1) (not (bvsgt .cse3 (_ bv0 32)))))))))) is different from true [2024-11-09 06:18:42,809 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:18:42,809 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:18:42,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242341249] [2024-11-09 06:18:42,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242341249] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:18:42,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [847546258] [2024-11-09 06:18:42,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:18:42,810 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:18:42,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:18:42,813 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:18:42,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-09 06:18:43,277 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:18:43,277 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:18:43,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 06:18:43,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:04,862 WARN L286 SmtUtils]: Spent 16.74s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:20:21,433 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main1_~x~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_gcd_test_~b#1_32| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~b#1_32|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_16|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse0))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse1))))) (and (bvslt .cse0 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse1 .cse2))) (_ bv0 32)) (bvsgt .cse3 (_ bv0 32)) (not (bvsge .cse3 .cse2))))))))) is different from false [2024-11-09 06:20:23,454 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main1_~x~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_gcd_test_~b#1_32| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~b#1_32|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_16|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse0))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse1))))) (and (bvslt .cse0 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse1 .cse2))) (_ bv0 32)) (bvsgt .cse3 (_ bv0 32)) (not (bvsge .cse3 .cse2))))))))) is different from true [2024-11-09 06:20:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:23,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:20:54,177 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_17| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_17|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse0))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse1))))) (or (not (bvslt .cse0 (_ bv0 32))) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse1 .cse2))))) (not (bvsgt .cse3 (_ bv0 32))) (bvsge .cse3 .cse2)))))))) is different from false [2024-11-09 06:20:56,198 WARN L873 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_17| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_17|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse0))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse1))))) (or (not (bvslt .cse0 (_ bv0 32))) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse1 .cse2))))) (not (bvsgt .cse3 (_ bv0 32))) (bvsge .cse3 .cse2)))))))) is different from true [2024-11-09 06:21:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:10,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [847546258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:21:10,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737860714] [2024-11-09 06:21:10,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:21:10,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:21:10,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:21:10,962 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:21:10,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03fa5a75-d503-4735-bae5-612881a90a32/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 06:21:14,960 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:21:14,960 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:21:14,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 06:21:14,983 INFO L278 TraceCheckSpWp]: Computing forward predicates...