./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_2_4.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_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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_0b094e0d-c6d3-4d96-b631-f554c35ee467/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 1d3494a64b97ff198f649db9990f4b24e7ade2324c824b5bf3f291e4c895b3e7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:18:48,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:18:48,454 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 06:18:48,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:18:48,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:18:48,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:18:48,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:18:48,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:18:48,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:18:48,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:18:48,487 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:18:48,487 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:18:48,488 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:18:48,488 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:18:48,488 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:18:48,489 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:18:48,489 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:18:48,490 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:18:48,490 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:18:48,491 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:18:48,491 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:18:48,492 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:18:48,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:18:48,493 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:18:48,494 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:18:48,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:18:48,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:18:48,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:18:48,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:18:48,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:18:48,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:18:48,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:18:48,497 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:18:48,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:18:48,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:18:48,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:18:48,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:18:48,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:18:48,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:18:48,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:18:48,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:18:48,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:18:48,501 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:18:48,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:18:48,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:18:48,503 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:18:48,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:18:48,503 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_0b094e0d-c6d3-4d96-b631-f554c35ee467/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_0b094e0d-c6d3-4d96-b631-f554c35ee467/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 -> 1d3494a64b97ff198f649db9990f4b24e7ade2324c824b5bf3f291e4c895b3e7 [2024-11-09 06:18:48,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:18:48,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:18:48,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:18:48,821 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:18:48,821 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:18:48,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/combinations/gcd_3+newton_2_4.i Unable to find full path for "g++" [2024-11-09 06:18:50,887 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:18:51,059 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:18:51,060 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/sv-benchmarks/c/combinations/gcd_3+newton_2_4.i [2024-11-09 06:18:51,068 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/data/1198dee32/dd9f1f0ddcf84bf19e44c1dbf9dcbd14/FLAGa16ed5e7c [2024-11-09 06:18:51,088 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/data/1198dee32/dd9f1f0ddcf84bf19e44c1dbf9dcbd14 [2024-11-09 06:18:51,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:18:51,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:18:51,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:18:51,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:18:51,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:18:51,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:18:51" (1/1) ... [2024-11-09 06:18:51,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebc47fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:18:51, skipping insertion in model container [2024-11-09 06:18:51,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:18:51" (1/1) ... [2024-11-09 06:18:51,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:18:51,320 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_0b094e0d-c6d3-4d96-b631-f554c35ee467/sv-benchmarks/c/combinations/gcd_3+newton_2_4.i[1226,1239] [2024-11-09 06:18:51,348 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_0b094e0d-c6d3-4d96-b631-f554c35ee467/sv-benchmarks/c/combinations/gcd_3+newton_2_4.i[2841,2854] [2024-11-09 06:18:51,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:18:51,360 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:18:51,374 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_0b094e0d-c6d3-4d96-b631-f554c35ee467/sv-benchmarks/c/combinations/gcd_3+newton_2_4.i[1226,1239] [2024-11-09 06:18:51,386 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_0b094e0d-c6d3-4d96-b631-f554c35ee467/sv-benchmarks/c/combinations/gcd_3+newton_2_4.i[2841,2854] [2024-11-09 06:18:51,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:18:51,406 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:18:51,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:18:51 WrapperNode [2024-11-09 06:18:51,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:18:51,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:18:51,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:18:51,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:18:51,416 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:18:51" (1/1) ... [2024-11-09 06:18:51,424 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:18:51" (1/1) ... [2024-11-09 06:18:51,447 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2024-11-09 06:18:51,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:18:51,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:18:51,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:18:51,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:18:51,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:18:51" (1/1) ... [2024-11-09 06:18:51,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:18:51" (1/1) ... [2024-11-09 06:18:51,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:18:51" (1/1) ... [2024-11-09 06:18:51,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:18:51" (1/1) ... [2024-11-09 06:18:51,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:18:51" (1/1) ... [2024-11-09 06:18:51,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:18:51" (1/1) ... [2024-11-09 06:18:51,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:18:51" (1/1) ... [2024-11-09 06:18:51,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:18:51" (1/1) ... [2024-11-09 06:18:51,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:18:51,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:18:51,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:18:51,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:18:51,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:18:51" (1/1) ... [2024-11-09 06:18:51,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:18:51,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:18:51,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:18:51,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:18:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:18:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-09 06:18:51,555 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-09 06:18:51,555 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-09 06:18:51,555 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-09 06:18:51,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:18:51,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:18:51,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:18:51,643 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:18:51,645 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:18:51,923 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-09 06:18:51,923 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:18:51,992 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:18:51,993 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:18:51,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:18:51 BoogieIcfgContainer [2024-11-09 06:18:51,993 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:18:51,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:18:51,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:18:52,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:18:52,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:18:51" (1/3) ... [2024-11-09 06:18:52,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1159c633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:18:52, skipping insertion in model container [2024-11-09 06:18:52,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:18:51" (2/3) ... [2024-11-09 06:18:52,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1159c633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:18:52, skipping insertion in model container [2024-11-09 06:18:52,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:18:51" (3/3) ... [2024-11-09 06:18:52,003 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_4.i [2024-11-09 06:18:52,028 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:18:52,028 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 06:18:52,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:18:52,105 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;@39b275e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:18:52,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 06:18:52,110 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:18:52,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:18:52,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:52,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:52,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:18:52,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:52,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1074225707, now seen corresponding path program 1 times [2024-11-09 06:18:52,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:18:52,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930875566] [2024-11-09 06:18:52,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:52,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:18:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:52,666 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:18:52,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:18:52,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930875566] [2024-11-09 06:18:52,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930875566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:18:52,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:18:52,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:18:52,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650525293] [2024-11-09 06:18:52,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:18:52,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:18:52,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:18:52,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:18:52,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:18:52,740 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:18:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:18:52,856 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-11-09 06:18:52,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:18:52,858 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:18:52,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:18:52,866 INFO L225 Difference]: With dead ends: 39 [2024-11-09 06:18:52,866 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 06:18:52,870 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:18:52,876 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:18:52,878 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:18:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 06:18:52,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 06:18:52,919 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:18:52,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-09 06:18:52,923 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2024-11-09 06:18:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:18:52,923 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-09 06:18:52,924 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:18:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-09 06:18:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 06:18:52,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:18:52,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:18:52,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:18:52,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:18:52,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:18:52,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1198724816, now seen corresponding path program 1 times [2024-11-09 06:18:52,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:18:52,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22511806] [2024-11-09 06:18:52,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:52,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:18:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 06:18:52,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1790843939] [2024-11-09 06:18:52,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:18:52,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:18:52,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:18:52,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:18:52,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:18:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:18:53,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 06:18:53,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:18:56,760 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:18:57,133 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:19:00,725 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:19:00,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:19:02,494 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:19:02,495 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:19:02,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22511806] [2024-11-09 06:19:02,496 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 06:19:02,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790843939] [2024-11-09 06:19:02,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790843939] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:19:02,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1139382446] [2024-11-09 06:19:02,524 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 06:19:02,525 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:19:02,529 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:19:02,536 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:19:02,536 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:19:03,474 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:19:12,123 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '180#(<= 1 |#StackHeapBarrier|)' at error location [2024-11-09 06:19:12,123 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:19:12,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:19:12,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2024-11-09 06:19:12,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746427029] [2024-11-09 06:19:12,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:19:12,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:19:12,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:19:12,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:19:12,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=193, Unknown=5, NotChecked=58, Total=306 [2024-11-09 06:19:12,128 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:19:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:19:33,517 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-11-09 06:19:33,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:19:33,519 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:19:33,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:19:33,520 INFO L225 Difference]: With dead ends: 34 [2024-11-09 06:19:33,520 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 06:19:33,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=65, Invalid=275, Unknown=10, NotChecked=70, Total=420 [2024-11-09 06:19:33,523 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:19:33,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 98 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 1 Unknown, 72 Unchecked, 0.7s Time] [2024-11-09 06:19:33,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 06:19:33,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 06:19:33,532 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:19:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-09 06:19:33,533 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 9 [2024-11-09 06:19:33,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:19:33,534 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-09 06:19:33,534 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:19:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-09 06:19:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:19:33,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:19:33,535 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:19:33,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:19:33,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:19:33,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:19:33,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:19:33,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1850413146, now seen corresponding path program 2 times [2024-11-09 06:19:33,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:19:33,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791420150] [2024-11-09 06:19:33,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:19:33,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:19:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 06:19:33,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1028213811] [2024-11-09 06:19:33,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:19:33,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:19:33,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:19:33,866 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:19:33,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:19:33,961 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 06:19:33,961 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:19:33,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 06:19:33,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:19:36,700 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse7 (<= .cse8 127)) (.cse6 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse3 (+ .cse8 (- 256))) (.cse4 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse2 (<= 128 .cse8)) (.cse1 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)))) .cse0) (and .cse1 (or (and .cse2 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (= (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_35|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (let ((.cse5 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= .cse5 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (= (mod (+ .cse5 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256) .cse6)))))) (and .cse7 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_35|))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127))) .cse0) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127))) .cse7) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (let ((.cse9 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= .cse9 0)) (= .cse6 (mod (+ .cse9 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (= (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_35|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127))) .cse4)) .cse2)) .cse1)))) is different from true [2024-11-09 06:19:37,547 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (let ((.cse5 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse4 (<= .cse5 127)) (.cse0 (<= 128 .cse5)) (.cse2 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse3 (+ .cse5 (- 256))) (.cse6 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse7 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (let ((.cse1 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= .cse1 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (= (mod (+ .cse1 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256) .cse2))))) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse5 |v_ULTIMATE.start_gcd_test_~b#1_35|)))))) .cse6) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)))) .cse7) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse5 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127))) .cse4) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (let ((.cse8 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= .cse8 0)) (= .cse2 (mod (+ .cse8 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127)))))) .cse6) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127))) .cse7))))) is different from true [2024-11-09 06:19:46,382 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse6 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse1 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (or (and (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (let ((.cse2 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse7 (<= 128 (mod .cse2 256))) (.cse5 (<= .cse1 127)) (.cse9 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse1 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod (+ .cse2 .cse3) 256) .cse4) (not (= .cse3 0))))) .cse5) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse1 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0))) .cse5 .cse6 .cse7))) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse2 .cse8) 256) .cse4) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse8 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|))) .cse6) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|))) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|)))) .cse9) (and (or (and .cse5 .cse6 .cse7 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse1 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0)))) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse1 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (= (mod (+ .cse2 .cse10) 256) .cse4) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse10 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127))))) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse1 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127))))) .cse0) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod (+ .cse2 .cse11) 256) .cse4) (not (= .cse11 0))))) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|))) .cse6)) .cse9))))) (and (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0) (let ((.cse12 (<= 128 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256))) (.cse15 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse16 (+ .cse1 (- 256))) (.cse13 (<= 128 .cse1))) (or (and .cse0 (or (and .cse12 .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse14 (mod .cse16 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (not (= .cse14 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse15 (mod (+ .cse14 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256))))) .cse6) (and .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse18 (mod .cse16 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse17) 256) .cse4) (not (= .cse18 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= .cse17 0)) (= .cse15 (mod (+ .cse18 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256)))))))) (and .cse0 (or (and .cse12 .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse19 (mod .cse16 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (not (= .cse19 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse15 (mod (+ .cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256))))) .cse6) (and .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse21 (mod .cse16 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse20) 256) .cse4) (not (= .cse21 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse20 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= .cse15 (mod (+ .cse21 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse22 (mod .cse16 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (not (= .cse22 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= .cse15 (mod (+ .cse22 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256))))) .cse13)))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from true [2024-11-09 06:19:52,524 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse6 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse0 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse1 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (or (and (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (let ((.cse2 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse7 (<= 128 (mod .cse2 256))) (.cse8 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse2 .cse11) 256) .cse4) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse11 0)))))) (.cse5 (<= .cse1 127)) (.cse9 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse1 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod (+ .cse2 .cse3) 256) .cse4) (not (= .cse3 0))))) .cse5) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse1 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0))) .cse5 .cse6 .cse7))) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|))) .cse8) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|))) .cse6) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|))) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|)))) .cse9) (and .cse0 (or (and .cse5 .cse6 .cse7 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse1 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0)))) (and .cse5 .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse1 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127)))) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse1 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127)))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod (+ .cse2 .cse10) 256) .cse4) (not (= .cse10 0))))) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|))) .cse6)) .cse9))))) (and (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0) (let ((.cse12 (<= 128 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256))) (.cse15 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse16 (+ .cse1 (- 256))) (.cse13 (<= 128 .cse1))) (or (and .cse0 (or (and .cse12 .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse14 (mod .cse16 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (not (= .cse14 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse15 (mod (+ .cse14 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256))))) .cse6) (and .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse18 (mod .cse16 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse17) 256) .cse4) (not (= .cse18 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= .cse17 0)) (= .cse15 (mod (+ .cse18 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256)))))))) (and (or (and .cse12 .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse19 (mod .cse16 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (not (= .cse19 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse15 (mod (+ .cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256))))) .cse6) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse20) 256) .cse4) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse20 0))))) .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (let ((.cse21 (mod .cse16 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (not (= .cse21 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= .cse15 (mod (+ .cse21 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse22 (mod .cse16 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (not (= .cse22 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= .cse15 (mod (+ .cse22 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256))))) .cse13)) .cse0)))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from true [2024-11-09 06:20:02,941 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse16 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse9 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse1 (<= 128 .cse16)) (.cse13 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse6 (+ .cse16 (- 256))) (.cse2 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse24 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse0 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse12 (<= .cse16 127)) (.cse19 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse11 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) (or (and .cse0 (let ((.cse3 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and .cse1 .cse2 (<= 128 (mod .cse3 256)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse5 (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse4 (+ (- 256) (mod (+ .cse5 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256)))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (= (mod .cse4 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse5 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse4) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127)))))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse7 (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse10 (+ (- 256) (mod (+ .cse7 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256)))) (let ((.cse8 (mod .cse10 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (not (= .cse7 0)) (= (mod (+ .cse8 .cse3) 256) .cse9) (not (= .cse8 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse10) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127))))))))) .cse11) (and (or (and .cse0 .cse12 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse15 (mod .cse16 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse15))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= .cse13 (mod (+ .cse14 (* 255 .cse15)) 256)) (not (= .cse15 0)) (= (mod .cse15 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse14 0))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse17 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse17))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod .cse17 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (= .cse13 (mod (+ (* .cse17 255) .cse18) 256)) (not (= .cse17 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (not (= .cse18 0)))))) .cse19) (and .cse0 .cse12 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse21 (mod .cse16 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse21))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= .cse13 (mod (+ .cse20 (* 255 .cse21)) 256)) (not (= .cse21 0)) (= (mod .cse21 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse20 0))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse22 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse22))) (and (= (mod .cse22 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (= .cse13 (mod (+ (* .cse22 255) .cse23) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (not (= .cse22 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= .cse23 0)))))) .cse19)) .cse24) (and (let ((.cse28 (<= 128 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)))) (or (and .cse1 .cse0 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse27 (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse26 (+ (mod (+ .cse27 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256) (- 256)))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse26))) (and (not (= .cse25 0)) (= (mod .cse26 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (not (= .cse27 0)) (= .cse13 (mod (+ .cse27 .cse25 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|)))))) .cse28 .cse2) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse30 (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse31 (+ (mod (+ .cse30 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256) (- 256)))) (let ((.cse29 (mod .cse31 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (not (= .cse29 0)) (not (= .cse30 0)) (= .cse13 (mod (+ .cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse31) |v_ULTIMATE.start_gcd_test_~b#1_35|) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= .cse9 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse29) 256))))))))) (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse33 (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (.cse34 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse32 (+ (- 256) (mod (+ .cse33 .cse34) 256)))) (let ((.cse35 (mod .cse32 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (= .cse13 (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse32) .cse33 .cse34) 256)) (not (= .cse33 0)) (not (= .cse35 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse9))))))) (and .cse28 .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse38 (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (.cse39 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse36 (+ (- 256) (mod (+ .cse38 .cse39) 256)))) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse36))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (= (mod .cse36 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse13 (mod (+ .cse37 .cse38 .cse39) 256)) (not (= .cse38 0)) (not (= .cse37 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127)))))) .cse2))))) .cse24) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse40 (mod .cse16 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse40) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (not (= .cse40 0)) (= (mod .cse40 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse0 .cse12) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse41 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (= (mod .cse41 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse41)) (not (= .cse41 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127)))) .cse19)) .cse11)))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2024-11-09 06:20:16,221 WARN L286 SmtUtils]: Spent 9.18s on a formula simplification. DAG size of input: 130 DAG size of output: 116 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:20:32,606 WARN L286 SmtUtils]: Spent 7.23s on a formula simplification. DAG size of input: 117 DAG size of output: 116 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:20:36,960 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:20:36,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:21:48,859 WARN L286 SmtUtils]: Spent 39.84s on a formula simplification. DAG size of input: 86 DAG size of output: 52 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:23:14,292 WARN L286 SmtUtils]: Spent 25.46s on a formula simplification. DAG size of input: 102 DAG size of output: 98 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:23:45,062 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:23:45,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:23:45,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791420150] [2024-11-09 06:23:45,063 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 06:23:45,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028213811] [2024-11-09 06:23:45,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028213811] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:23:45,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1838481864] [2024-11-09 06:23:45,065 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 06:23:45,065 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:23:45,066 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:23:45,066 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:23:45,066 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:23:45,619 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:24:05,539 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '368#(<= 1 |#StackHeapBarrier|)' at error location [2024-11-09 06:24:05,540 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:24:05,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:24:05,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2024-11-09 06:24:05,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330691479] [2024-11-09 06:24:05,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:24:05,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 06:24:05,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:24:05,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 06:24:05,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=304, Unknown=23, NotChecked=200, Total=600 [2024-11-09 06:24:05,543 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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:24:07,155 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse44 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse18 (mod (+ .cse44 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse15 (mod .cse44 256))) (let ((.cse4 (< .cse15 128)) (.cse14 (< 127 .cse15)) (.cse10 (< 127 .cse18)) (.cse1 (= .cse44 0)) (.cse7 (< 127 .cse17)) (.cse16 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse8 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse3 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse2 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse0) (not .cse1) .cse2) (or .cse3 .cse2 (let ((.cse11 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse12 (< .cse18 .cse0)) (.cse13 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse18) 0))) (.cse5 (< .cse17 .cse0)) (.cse6 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse9 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse17) 0)))) (and (or .cse4 (and (or .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse13 .cse8))) (or .cse14 (and (or .cse10 .cse1 .cse11 .cse12 .cse13 .cse8) (or .cse1 .cse5 .cse6 .cse7 .cse8 .cse9) (or (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse15) 0)) .cse16 (< .cse15 .cse0))))))) (let ((.cse26 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse19 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse25 (<= .cse26 127)) (.cse24 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse22 (+ .cse26 (- 256))) (.cse21 (<= 128 .cse26)) (.cse20 (<= .cse0 0))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)))) .cse19) (and .cse20 (or (and .cse21 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (= (mod .cse22 |v_ULTIMATE.start_gcd_test_~b#1_35|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|))) .cse3) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (let ((.cse23 (mod .cse22 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= .cse23 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (= (mod (+ .cse23 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256) .cse24)))))) (and .cse25 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse26 |v_ULTIMATE.start_gcd_test_~b#1_35|))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127))) .cse19) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse26 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127))) .cse25) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (let ((.cse27 (mod .cse22 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= .cse27 0)) (= .cse24 (mod (+ .cse27 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (= (mod .cse22 |v_ULTIMATE.start_gcd_test_~b#1_35|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127))) .cse3)) .cse21)) .cse20)))) (or .cse2 (let ((.cse38 (= .cse18 0)) (.cse39 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse18))) (or (not (= (mod .cse18 (mod .cse43 256)) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (< .cse43 .cse0)))))) (let ((.cse32 (< .cse18 128)) (.cse30 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse42 (+ (- 256) .cse18))) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse42))) (or (< .cse41 .cse0) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= (mod .cse42 (mod .cse41 256)) 0))))))) (.cse28 (< .cse17 128)) (.cse34 (or .cse38 .cse8 .cse39))) (and (or (let ((.cse31 (or .cse16 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse35 (+ (- 256) .cse15))) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse35))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= (mod .cse35 (mod .cse36 256)) 0)) (< .cse36 .cse0)))))))) (and (or (let ((.cse29 (and (or .cse30 .cse8) .cse31))) (and (or .cse28 .cse29) (or .cse7 .cse29))) .cse32) (or .cse10 (let ((.cse33 (and .cse34 .cse31))) (and (or .cse33 .cse28) (or .cse7 .cse33)))))) .cse4) (or .cse14 (let ((.cse37 (or .cse16 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse15))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= (mod .cse15 (mod .cse40 256)) 0)) (< .cse40 .cse0)))) (= .cse15 0)))) (and (or .cse32 (and .cse37 (or .cse1 .cse30 .cse8))) (or .cse10 (and (or (and .cse37 (or .cse1 .cse38 .cse8 .cse39)) .cse28) (or (and .cse37 .cse34) .cse7)))))))))) (or (not .cse3) (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse0) .cse2))))) is different from false [2024-11-09 06:24:09,842 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse44 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse18 (mod (+ .cse44 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse15 (mod .cse44 256))) (let ((.cse4 (< .cse15 128)) (.cse14 (< 127 .cse15)) (.cse10 (< 127 .cse18)) (.cse1 (= .cse44 0)) (.cse7 (< 127 .cse17)) (.cse16 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse8 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse3 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse2 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse0) (not .cse1) .cse2) (or .cse3 .cse2 (let ((.cse11 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse12 (< .cse18 .cse0)) (.cse13 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse18) 0))) (.cse5 (< .cse17 .cse0)) (.cse6 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse9 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse17) 0)))) (and (or .cse4 (and (or .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse13 .cse8))) (or .cse14 (and (or .cse10 .cse1 .cse11 .cse12 .cse13 .cse8) (or .cse1 .cse5 .cse6 .cse7 .cse8 .cse9) (or (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse15) 0)) .cse16 (< .cse15 .cse0))))))) (let ((.cse26 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse19 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse25 (<= .cse26 127)) (.cse24 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse22 (+ .cse26 (- 256))) (.cse21 (<= 128 .cse26)) (.cse20 (<= .cse0 0))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)))) .cse19) (and .cse20 (or (and .cse21 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (= (mod .cse22 |v_ULTIMATE.start_gcd_test_~b#1_35|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|))) .cse3) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (let ((.cse23 (mod .cse22 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= .cse23 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (= (mod (+ .cse23 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256) .cse24)))))) (and .cse25 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse26 |v_ULTIMATE.start_gcd_test_~b#1_35|))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127))) .cse19) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse26 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127))) .cse25) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (let ((.cse27 (mod .cse22 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= .cse27 0)) (= .cse24 (mod (+ .cse27 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (= (mod .cse22 |v_ULTIMATE.start_gcd_test_~b#1_35|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127))) .cse3)) .cse21)) .cse20)))) (or .cse2 (let ((.cse38 (= .cse18 0)) (.cse39 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse18))) (or (not (= (mod .cse18 (mod .cse43 256)) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (< .cse43 .cse0)))))) (let ((.cse32 (< .cse18 128)) (.cse30 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse42 (+ (- 256) .cse18))) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse42))) (or (< .cse41 .cse0) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= (mod .cse42 (mod .cse41 256)) 0))))))) (.cse28 (< .cse17 128)) (.cse34 (or .cse38 .cse8 .cse39))) (and (or (let ((.cse31 (or .cse16 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse35 (+ (- 256) .cse15))) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse35))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= (mod .cse35 (mod .cse36 256)) 0)) (< .cse36 .cse0)))))))) (and (or (let ((.cse29 (and (or .cse30 .cse8) .cse31))) (and (or .cse28 .cse29) (or .cse7 .cse29))) .cse32) (or .cse10 (let ((.cse33 (and .cse34 .cse31))) (and (or .cse33 .cse28) (or .cse7 .cse33)))))) .cse4) (or .cse14 (let ((.cse37 (or .cse16 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse15))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= (mod .cse15 (mod .cse40 256)) 0)) (< .cse40 .cse0)))) (= .cse15 0)))) (and (or .cse32 (and .cse37 (or .cse1 .cse30 .cse8))) (or .cse10 (and (or (and .cse37 (or .cse1 .cse38 .cse8 .cse39)) .cse28) (or (and .cse37 .cse34) .cse7)))))))))) (or (not .cse3) (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse0) .cse2))))) is different from true [2024-11-09 06:24:12,273 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse43 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse23 (mod (+ .cse43 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse26 (mod (+ .cse43 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse16 (mod .cse43 256))) (let ((.cse2 (< |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse17 (< .cse16 128)) (.cse18 (< 127 .cse16)) (.cse10 (< 127 .cse26)) (.cse1 (= .cse43 0)) (.cse5 (< 127 .cse23)) (.cse7 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse13 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse0) (not .cse1) .cse2) (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (or .cse2 (let ((.cse20 (= .cse26 0)) (.cse21 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse26))) (or (not (= (mod .cse26 (mod .cse27 256)) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (< .cse27 .cse0)))))) (let ((.cse9 (< .cse26 128)) (.cse6 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse25 (+ (- 256) .cse26))) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse25))) (or (< .cse24 .cse0) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= (mod .cse25 (mod .cse24 256)) 0))))))) (.cse3 (< .cse23 128)) (.cse12 (or .cse20 .cse7 .cse21))) (and (or (let ((.cse8 (or .cse13 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse14 (+ (- 256) .cse16))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse14))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= (mod .cse14 (mod .cse15 256)) 0)) (< .cse15 .cse0)))))))) (and (or (let ((.cse4 (and (or .cse6 .cse7) .cse8))) (and (or .cse3 .cse4) (or .cse5 .cse4))) .cse9) (or .cse10 (let ((.cse11 (and .cse12 .cse8))) (and (or .cse11 .cse3) (or .cse5 .cse11)))))) .cse17) (or .cse18 (let ((.cse19 (or .cse13 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse16))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= (mod .cse16 (mod .cse22 256)) 0)) (< .cse22 .cse0)))) (= .cse16 0)))) (and (or .cse9 (and .cse19 (or .cse1 .cse6 .cse7))) (or .cse10 (and (or (and .cse19 (or .cse1 .cse20 .cse7 .cse21)) .cse3) (or (and .cse19 .cse12) .cse5)))))))))) (or .cse2 (let ((.cse31 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse32 (< .cse26 .cse0)) (.cse33 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse26) 0))) (.cse28 (< .cse23 .cse0)) (.cse29 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse30 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse23) 0)))) (and (or .cse17 (and (or .cse28 .cse29 .cse5 .cse7 .cse30) (or .cse10 .cse31 .cse32 .cse33 .cse7))) (or .cse18 (and (or .cse10 .cse1 .cse31 .cse32 .cse33 .cse7) (or .cse1 .cse28 .cse29 .cse5 .cse7 .cse30) (or (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 0)) .cse13 (< .cse16 .cse0))))))) (let ((.cse39 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse38 (<= .cse39 127)) (.cse34 (<= 128 .cse39)) (.cse36 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse37 (+ .cse39 (- 256))) (.cse40 (<= .cse0 0)) (.cse41 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and (or (and .cse34 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (let ((.cse35 (mod .cse37 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= .cse35 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (= (mod (+ .cse35 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256) .cse36))))) (and .cse38 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse39 |v_ULTIMATE.start_gcd_test_~b#1_35|)))))) .cse40) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)))) .cse41) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse39 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127))) .cse38) (and .cse34 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (let ((.cse42 (mod .cse37 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= .cse42 0)) (= .cse36 (mod (+ .cse42 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127)))))) .cse40) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127))) .cse41)))))))) is different from false [2024-11-09 06:24:39,578 WARN L286 SmtUtils]: Spent 21.11s on a formula simplification. DAG size of input: 185 DAG size of output: 125 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:24:41,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 06:24:42,053 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse58 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse47 (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse50 (mod (+ .cse58 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse40 (mod .cse58 256))) (let ((.cse2 (< |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse41 (< .cse40 128)) (.cse42 (< 127 .cse40)) (.cse34 (< 127 .cse50)) (.cse1 (= .cse58 0)) (.cse29 (< 127 .cse47)) (.cse31 (< 0 .cse15)) (.cse37 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse0) (not .cse1) .cse2) (let ((.cse9 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse7 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse3 (<= .cse0 0)) (.cse4 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (or (and (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (let ((.cse5 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse10 (<= 128 (mod .cse5 256))) (.cse11 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse5 .cse14) 256) .cse7) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse14 0)))))) (.cse8 (<= .cse4 127)) (.cse12 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse3 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod (+ .cse5 .cse6) 256) .cse7) (not (= .cse6 0))))) .cse8) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0))) .cse8 .cse9 .cse10))) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|))) .cse11) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|))) .cse9) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|))) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|)))) .cse12) (and .cse3 (or (and .cse8 .cse9 .cse10 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0)))) (and .cse8 .cse11 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127)))) (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127)))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod (+ .cse5 .cse13) 256) .cse7) (not (= .cse13 0))))) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|))) .cse9)) .cse12))))) (and (<= .cse15 0) (let ((.cse16 (<= 128 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256))) (.cse19 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse20 (+ .cse4 (- 256))) (.cse17 (<= 128 .cse4))) (or (and .cse3 (or (and .cse16 .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse18 (mod .cse20 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (not (= .cse18 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse19 (mod (+ .cse18 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256))))) .cse9) (and .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse22 (mod .cse20 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse21) 256) .cse7) (not (= .cse22 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= .cse21 0)) (= .cse19 (mod (+ .cse22 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256)))))))) (and (or (and .cse16 .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse23 (mod .cse20 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (not (= .cse23 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse19 (mod (+ .cse23 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256))))) .cse9) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse24) 256) .cse7) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse24 0))))) .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (let ((.cse25 (mod .cse20 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (not (= .cse25 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= .cse19 (mod (+ .cse25 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse26 (mod .cse20 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (not (= .cse26 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= .cse19 (mod (+ .cse26 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256))))) .cse17)) .cse3)))))) (or .cse2 (let ((.cse44 (= .cse50 0)) (.cse45 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse50))) (or (not (= (mod .cse50 (mod .cse51 256)) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (< .cse51 .cse0)))))) (let ((.cse33 (< .cse50 128)) (.cse30 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse49 (+ (- 256) .cse50))) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse49))) (or (< .cse48 .cse0) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= (mod .cse49 (mod .cse48 256)) 0))))))) (.cse27 (< .cse47 128)) (.cse36 (or .cse44 .cse31 .cse45))) (and (or (let ((.cse32 (or .cse37 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse38 (+ (- 256) .cse40))) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse38))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= (mod .cse38 (mod .cse39 256)) 0)) (< .cse39 .cse0)))))))) (and (or (let ((.cse28 (and (or .cse30 .cse31) .cse32))) (and (or .cse27 .cse28) (or .cse29 .cse28))) .cse33) (or .cse34 (let ((.cse35 (and .cse36 .cse32))) (and (or .cse35 .cse27) (or .cse29 .cse35)))))) .cse41) (or .cse42 (let ((.cse43 (or .cse37 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse40))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= (mod .cse40 (mod .cse46 256)) 0)) (< .cse46 .cse0)))) (= .cse40 0)))) (and (or .cse33 (and .cse43 (or .cse1 .cse30 .cse31))) (or .cse34 (and (or (and .cse43 (or .cse1 .cse44 .cse31 .cse45)) .cse27) (or (and .cse43 .cse36) .cse29)))))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse0) .cse2) (or .cse2 (let ((.cse55 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse56 (< .cse50 .cse0)) (.cse57 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse50) 0))) (.cse52 (< .cse47 .cse0)) (.cse53 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse54 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse47) 0)))) (and (or .cse41 (and (or .cse52 .cse53 .cse29 .cse31 .cse54) (or .cse34 .cse55 .cse56 .cse57 .cse31))) (or .cse42 (and (or .cse34 .cse1 .cse55 .cse56 .cse57 .cse31) (or .cse1 .cse52 .cse53 .cse29 .cse31 .cse54) (or (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse40) 0)) .cse37 (< .cse40 .cse0))))))))))) is different from false [2024-11-09 06:24:44,213 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse58 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse47 (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse50 (mod (+ .cse58 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse40 (mod .cse58 256))) (let ((.cse2 (< |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse41 (< .cse40 128)) (.cse42 (< 127 .cse40)) (.cse34 (< 127 .cse50)) (.cse1 (= .cse58 0)) (.cse29 (< 127 .cse47)) (.cse31 (< 0 .cse15)) (.cse37 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse0) (not .cse1) .cse2) (let ((.cse9 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse7 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse3 (<= .cse0 0)) (.cse4 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (or (and (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (let ((.cse5 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse10 (<= 128 (mod .cse5 256))) (.cse11 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse5 .cse14) 256) .cse7) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse14 0)))))) (.cse8 (<= .cse4 127)) (.cse12 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse3 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod (+ .cse5 .cse6) 256) .cse7) (not (= .cse6 0))))) .cse8) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0))) .cse8 .cse9 .cse10))) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|))) .cse11) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|))) .cse9) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|))) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|)))) .cse12) (and .cse3 (or (and .cse8 .cse9 .cse10 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0)))) (and .cse8 .cse11 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127)))) (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127)))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod (+ .cse5 .cse13) 256) .cse7) (not (= .cse13 0))))) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|) |c_ULTIMATE.start_gcd_test_~a#1|))) .cse9)) .cse12))))) (and (<= .cse15 0) (let ((.cse16 (<= 128 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256))) (.cse19 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse20 (+ .cse4 (- 256))) (.cse17 (<= 128 .cse4))) (or (and .cse3 (or (and .cse16 .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse18 (mod .cse20 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (not (= .cse18 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse19 (mod (+ .cse18 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256))))) .cse9) (and .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse22 (mod .cse20 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse21) 256) .cse7) (not (= .cse22 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= .cse21 0)) (= .cse19 (mod (+ .cse22 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256)))))))) (and (or (and .cse16 .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse23 (mod .cse20 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (not (= .cse23 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse19 (mod (+ .cse23 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256))))) .cse9) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse24) 256) .cse7) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse24 0))))) .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int)) (let ((.cse25 (mod .cse20 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (not (= .cse25 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= .cse19 (mod (+ .cse25 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse26 (mod .cse20 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (not (= .cse26 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= .cse19 (mod (+ .cse26 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256))))) .cse17)) .cse3)))))) (or .cse2 (let ((.cse44 (= .cse50 0)) (.cse45 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse50))) (or (not (= (mod .cse50 (mod .cse51 256)) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (< .cse51 .cse0)))))) (let ((.cse33 (< .cse50 128)) (.cse30 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse49 (+ (- 256) .cse50))) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse49))) (or (< .cse48 .cse0) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= (mod .cse49 (mod .cse48 256)) 0))))))) (.cse27 (< .cse47 128)) (.cse36 (or .cse44 .cse31 .cse45))) (and (or (let ((.cse32 (or .cse37 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse38 (+ (- 256) .cse40))) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse38))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= (mod .cse38 (mod .cse39 256)) 0)) (< .cse39 .cse0)))))))) (and (or (let ((.cse28 (and (or .cse30 .cse31) .cse32))) (and (or .cse27 .cse28) (or .cse29 .cse28))) .cse33) (or .cse34 (let ((.cse35 (and .cse36 .cse32))) (and (or .cse35 .cse27) (or .cse29 .cse35)))))) .cse41) (or .cse42 (let ((.cse43 (or .cse37 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse40))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= (mod .cse40 (mod .cse46 256)) 0)) (< .cse46 .cse0)))) (= .cse40 0)))) (and (or .cse33 (and .cse43 (or .cse1 .cse30 .cse31))) (or .cse34 (and (or (and .cse43 (or .cse1 .cse44 .cse31 .cse45)) .cse27) (or (and .cse43 .cse36) .cse29)))))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse0) .cse2) (or .cse2 (let ((.cse55 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse56 (< .cse50 .cse0)) (.cse57 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse50) 0))) (.cse52 (< .cse47 .cse0)) (.cse53 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse54 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse47) 0)))) (and (or .cse41 (and (or .cse52 .cse53 .cse29 .cse31 .cse54) (or .cse34 .cse55 .cse56 .cse57 .cse31))) (or .cse42 (and (or .cse34 .cse1 .cse55 .cse56 .cse57 .cse31) (or .cse1 .cse52 .cse53 .cse29 .cse31 .cse54) (or (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse40) 0)) .cse37 (< .cse40 .cse0))))))))))) is different from true [2024-11-09 06:24:46,232 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 ((.cse1 (= .cse56 0)) (.cse45 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse5 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse2 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse0) (not .cse1) .cse2) (let ((.cse19 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse12 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse4 (<= 128 .cse19)) (.cse16 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse9 (+ .cse19 (- 256))) (.cse27 (<= .cse45 0)) (.cse3 (<= .cse0 0)) (.cse15 (<= .cse19 127)) (.cse22 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse14 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) (or (and .cse3 (let ((.cse6 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and .cse4 .cse5 (<= 128 (mod .cse6 256)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse8 (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse7 (+ (- 256) (mod (+ .cse8 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256)))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (= (mod .cse7 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse8 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse7) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127)))))) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse10 (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse13 (+ (- 256) (mod (+ .cse10 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|)) 256)))) (let ((.cse11 (mod .cse13 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (not (= .cse10 0)) (= (mod (+ .cse11 .cse6) 256) .cse12) (not (= .cse11 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse13) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127))))))))) .cse14) (and (or (and .cse3 .cse15 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse18 (mod .cse19 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse18))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= .cse16 (mod (+ .cse17 (* 255 .cse18)) 256)) (not (= .cse18 0)) (= (mod .cse18 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse17 0))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse20 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse20))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (= (mod .cse20 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (= .cse16 (mod (+ (* .cse20 255) .cse21) 256)) (not (= .cse20 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (not (= .cse21 0)))))) .cse22) (and .cse3 .cse15 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse24 (mod .cse19 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse24))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= .cse16 (mod (+ .cse23 (* 255 .cse24)) 256)) (not (= .cse24 0)) (= (mod .cse24 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse23 0))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse25 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse25))) (and (= (mod .cse25 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (= .cse16 (mod (+ (* .cse25 255) .cse26) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (not (= .cse25 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= .cse26 0)))))) .cse22)) .cse27) (and (let ((.cse31 (<= 128 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)))) (or (and .cse4 .cse3 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse30 (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse29 (+ (mod (+ .cse30 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256) (- 256)))) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse29))) (and (not (= .cse28 0)) (= (mod .cse29 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (not (= .cse30 0)) (= .cse16 (mod (+ .cse30 .cse28 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|)))))) .cse31 .cse5) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse33 (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse34 (+ (mod (+ .cse33 |v_ULTIMATE.start_gcd_test_~b#1_35|) 256) (- 256)))) (let ((.cse32 (mod .cse34 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_35| 1) 0) (not (= .cse32 0)) (not (= .cse33 0)) (= .cse16 (mod (+ .cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse34) |v_ULTIMATE.start_gcd_test_~b#1_35|) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (= .cse12 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse32) 256))))))))) (and .cse3 (or (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse36 (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (.cse37 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse35 (+ (- 256) (mod (+ .cse36 .cse37) 256)))) (let ((.cse38 (mod .cse35 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (= .cse16 (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse35) .cse36 .cse37) 256)) (not (= .cse36 0)) (not (= .cse38 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (= (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse12))))))) (and .cse31 .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse41 (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_35|)) (.cse42 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (let ((.cse39 (+ (- 256) (mod (+ .cse41 .cse42) 256)))) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse39))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_35|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_35| 0)) (= (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse16 (mod (+ .cse40 .cse41 .cse42) 256)) (not (= .cse41 0)) (not (= .cse40 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127)))))) .cse5))))) .cse27) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse43 (mod .cse19 |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse43) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127) (not (= .cse43 0)) (= (mod .cse43 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse3 .cse15) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_35| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse44 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_35|))) (and (= (mod .cse44 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse44)) (not (= .cse44 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_35|) (<= |v_ULTIMATE.start_gcd_test_~b#1_35| 127)))) .cse22)) .cse14)))) (or .cse5 .cse2 (let ((.cse57 (mod (+ .cse56 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse58 (mod (+ .cse56 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse52 (< 127 .cse58)) (.cse53 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse54 (< .cse58 .cse0)) (.cse55 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse58) 0))) (.cse47 (< .cse57 .cse0)) (.cse48 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse49 (< 127 .cse57)) (.cse50 (< 0 .cse45)) (.cse51 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse57) 0))) (.cse46 (mod .cse56 256))) (and (or (< .cse46 128) (and (or .cse47 .cse48 .cse49 .cse50 .cse51) (or .cse52 .cse53 .cse54 .cse55 .cse50))) (or (< 127 .cse46) (and (or .cse52 .cse1 .cse53 .cse54 .cse55 .cse50) (or .cse1 .cse47 .cse48 .cse49 .cse50 .cse51) (or (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse46) 0)) (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (< .cse46 .cse0)))))))) (or (not .cse5) (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse0) .cse2) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))))) is different from false [2024-11-09 06:24:55,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 06:24:57,657 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 [0, 1] [2024-11-09 06:24:59,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 06:25:01,078 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 [0] [2024-11-09 06:25:02,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 06:25:03,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 06:25:05,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 06:25:09,777 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 [0] [2024-11-09 06:25:10,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 06:25:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:11,425 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-11-09 06:25:11,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 06:25:11,426 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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:25:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:11,427 INFO L225 Difference]: With dead ends: 40 [2024-11-09 06:25:11,427 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 06:25:11,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 218.8s TimeCoverageRelationStatistics Valid=102, Invalid=406, Unknown=34, NotChecked=450, Total=992 [2024-11-09 06:25:11,429 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:11,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 168 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 6 Unknown, 243 Unchecked, 22.4s Time] [2024-11-09 06:25:11,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 06:25:11,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-09 06:25:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:25:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-11-09 06:25:11,447 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 13 [2024-11-09 06:25:11,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:11,448 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-11-09 06:25:11,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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:25:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-11-09 06:25:11,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 06:25:11,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:11,449 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:25:11,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:25:11,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:25:11,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:11,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:11,651 INFO L85 PathProgramCache]: Analyzing trace with hash 235847532, now seen corresponding path program 1 times [2024-11-09 06:25:11,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:25:11,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148367149] [2024-11-09 06:25:11,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:11,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:25:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:25:11,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:25:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:25:11,681 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 06:25:11,681 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:25:11,686 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-09 06:25:11,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-09 06:25:11,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:25:11,692 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-09 06:25:11,712 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:25:11,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:25:11 BoogieIcfgContainer [2024-11-09 06:25:11,716 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:25:11,716 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:25:11,716 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:25:11,717 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:25:11,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:18:51" (3/4) ... [2024-11-09 06:25:11,722 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 06:25:11,724 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:25:11,725 INFO L158 Benchmark]: Toolchain (without parser) took 380632.83ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 143.8MB in the beginning and 114.0MB in the end (delta: 29.8MB). Peak memory consumption was 115.0MB. Max. memory is 16.1GB. [2024-11-09 06:25:11,725 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 132.1MB. Free memory was 77.1MB in the beginning and 77.0MB in the end (delta: 178.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:25:11,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.49ms. Allocated memory is still 186.6MB. Free memory was 143.8MB in the beginning and 129.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 06:25:11,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.35ms. Allocated memory is still 186.6MB. Free memory was 129.8MB in the beginning and 128.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:25:11,730 INFO L158 Benchmark]: Boogie Preprocessor took 30.11ms. Allocated memory is still 186.6MB. Free memory was 128.3MB in the beginning and 126.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:25:11,730 INFO L158 Benchmark]: RCFGBuilder took 514.77ms. Allocated memory is still 186.6MB. Free memory was 126.5MB in the beginning and 108.8MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 06:25:11,730 INFO L158 Benchmark]: TraceAbstraction took 379719.68ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 108.2MB in the beginning and 114.0MB in the end (delta: -5.8MB). Peak memory consumption was 79.3MB. Max. memory is 16.1GB. [2024-11-09 06:25:11,731 INFO L158 Benchmark]: Witness Printer took 7.59ms. Allocated memory is still 270.5MB. Free memory is still 114.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:25:11,732 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.27ms. Allocated memory is still 132.1MB. Free memory was 77.1MB in the beginning and 77.0MB in the end (delta: 178.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.49ms. Allocated memory is still 186.6MB. Free memory was 143.8MB in the beginning and 129.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.35ms. Allocated memory is still 186.6MB. Free memory was 129.8MB in the beginning and 128.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.11ms. Allocated memory is still 186.6MB. Free memory was 128.3MB in the beginning and 126.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 514.77ms. Allocated memory is still 186.6MB. Free memory was 126.5MB in the beginning and 108.8MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 379719.68ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 108.2MB in the beginning and 114.0MB in the end (delta: -5.8MB). Peak memory consumption was 79.3MB. Max. memory is 16.1GB. * Witness Printer took 7.59ms. Allocated memory is still 270.5MB. Free memory is still 114.0MB. There was no memory consumed. 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 > -0.8f && IN < 0.8f) [L75] COND FALSE !(!cond) [L91] RET assume_abort_if_not(IN > -0.8f && IN < 0.8f) [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: 379.6s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 87.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 23.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 340 SdHoareTripleChecker+Invalid, 22.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 315 IncrementalHoareTripleChecker+Unchecked, 293 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 239 IncrementalHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 47 mSDtfsCounter, 239 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 253.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=3, InterpolantAutomatonStates: 34, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 260.9s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 46 ConstructedInterpolants, 12 QuantifiedInterpolants, 8146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/20 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:25:11,950 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-09 06:25:12,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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_0b094e0d-c6d3-4d96-b631-f554c35ee467/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 1d3494a64b97ff198f649db9990f4b24e7ade2324c824b5bf3f291e4c895b3e7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:25:14,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:25:14,461 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 06:25:14,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:25:14,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:25:14,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:25:14,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:25:14,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:25:14,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:25:14,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:25:14,514 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:25:14,514 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:25:14,515 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:25:14,515 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:25:14,516 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:25:14,517 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:25:14,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:25:14,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:25:14,520 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:25:14,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:25:14,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:25:14,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:25:14,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:25:14,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:25:14,526 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:25:14,526 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 06:25:14,526 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:25:14,527 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 06:25:14,527 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:25:14,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:25:14,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:25:14,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:25:14,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:25:14,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:25:14,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:25:14,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:25:14,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:25:14,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:25:14,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:25:14,530 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 06:25:14,530 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 06:25:14,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:25:14,531 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:25:14,531 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_0b094e0d-c6d3-4d96-b631-f554c35ee467/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_0b094e0d-c6d3-4d96-b631-f554c35ee467/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 -> 1d3494a64b97ff198f649db9990f4b24e7ade2324c824b5bf3f291e4c895b3e7 [2024-11-09 06:25:14,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:25:14,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:25:14,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:25:14,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:25:14,946 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:25:14,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/combinations/gcd_3+newton_2_4.i Unable to find full path for "g++" [2024-11-09 06:25:17,029 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:25:17,304 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:25:17,308 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/sv-benchmarks/c/combinations/gcd_3+newton_2_4.i [2024-11-09 06:25:17,322 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/data/e4a55a36f/6c2bb5e16cfb428cafdd70436400f664/FLAGb436df814 [2024-11-09 06:25:17,349 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/data/e4a55a36f/6c2bb5e16cfb428cafdd70436400f664 [2024-11-09 06:25:17,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:25:17,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:25:17,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:25:17,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:25:17,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:25:17,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:25:17" (1/1) ... [2024-11-09 06:25:17,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@694127fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:17, skipping insertion in model container [2024-11-09 06:25:17,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:25:17" (1/1) ... [2024-11-09 06:25:17,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:25:17,684 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_0b094e0d-c6d3-4d96-b631-f554c35ee467/sv-benchmarks/c/combinations/gcd_3+newton_2_4.i[1226,1239] [2024-11-09 06:25:17,736 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_0b094e0d-c6d3-4d96-b631-f554c35ee467/sv-benchmarks/c/combinations/gcd_3+newton_2_4.i[2841,2854] [2024-11-09 06:25:17,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:25:17,761 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:25:17,781 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_0b094e0d-c6d3-4d96-b631-f554c35ee467/sv-benchmarks/c/combinations/gcd_3+newton_2_4.i[1226,1239] [2024-11-09 06:25:17,808 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_0b094e0d-c6d3-4d96-b631-f554c35ee467/sv-benchmarks/c/combinations/gcd_3+newton_2_4.i[2841,2854] [2024-11-09 06:25:17,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:25:17,835 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:25:17,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:17 WrapperNode [2024-11-09 06:25:17,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:25:17,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:25:17,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:25:17,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:25:17,848 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:25:17" (1/1) ... [2024-11-09 06:25:17,867 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:25:17" (1/1) ... [2024-11-09 06:25:17,909 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2024-11-09 06:25:17,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:25:17,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:25:17,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:25:17,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:25:17,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:17" (1/1) ... [2024-11-09 06:25:17,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:17" (1/1) ... [2024-11-09 06:25:17,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:17" (1/1) ... [2024-11-09 06:25:17,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:17" (1/1) ... [2024-11-09 06:25:17,941 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:17" (1/1) ... [2024-11-09 06:25:17,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:17" (1/1) ... [2024-11-09 06:25:17,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:17" (1/1) ... [2024-11-09 06:25:17,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:17" (1/1) ... [2024-11-09 06:25:17,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:25:17,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:25:17,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:25:17,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:25:17,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:17" (1/1) ... [2024-11-09 06:25:17,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:25:17,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:25:18,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:25:18,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:25:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:25:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 06:25:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-09 06:25:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-09 06:25:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-09 06:25:18,047 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-09 06:25:18,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:25:18,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:25:18,129 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:25:18,131 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:25:26,608 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-09 06:25:26,609 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:25:26,628 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:25:26,628 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:25:26,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:25:26 BoogieIcfgContainer [2024-11-09 06:25:26,628 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:25:26,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:25:26,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:25:26,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:25:26,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:25:17" (1/3) ... [2024-11-09 06:25:26,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21aad39a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:25:26, skipping insertion in model container [2024-11-09 06:25:26,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:17" (2/3) ... [2024-11-09 06:25:26,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21aad39a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:25:26, skipping insertion in model container [2024-11-09 06:25:26,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:25:26" (3/3) ... [2024-11-09 06:25:26,642 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_4.i [2024-11-09 06:25:26,662 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:25:26,663 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 06:25:26,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:25:26,739 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;@3a5343ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:25:26,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 06:25:26,745 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:25:26,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:25:26,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:26,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:25:26,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:26,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:26,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1594868719, now seen corresponding path program 1 times [2024-11-09 06:25:26,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:25:26,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53387300] [2024-11-09 06:25:26,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:26,781 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:25:26,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:25:26,783 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:25:26,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:25:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:26,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:25:26,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:25:27,069 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:25:27,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:25:27,070 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:25:27,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53387300] [2024-11-09 06:25:27,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53387300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:25:27,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:25:27,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:25:27,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834606881] [2024-11-09 06:25:27,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:25:27,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:25:27,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:25:27,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:25:27,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:25:27,114 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:25:27,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:27,350 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2024-11-09 06:25:27,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:25:27,354 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:25:27,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:27,362 INFO L225 Difference]: With dead ends: 70 [2024-11-09 06:25:27,362 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 06:25:27,366 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:25:27,373 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:25:27,376 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:25:27,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 06:25:27,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 06:25:27,429 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:25:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-09 06:25:27,434 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2024-11-09 06:25:27,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:27,435 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-09 06:25:27,436 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:25:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-09 06:25:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:25:27,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:27,440 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:25:27,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:25:27,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:25:27,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:27,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:27,643 INFO L85 PathProgramCache]: Analyzing trace with hash 180138643, now seen corresponding path program 1 times [2024-11-09 06:25:27,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:25:27,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737361076] [2024-11-09 06:25:27,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:27,645 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:25:27,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:25:27,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:25:27,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:25:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:27,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:25:27,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:25:27,913 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:25:27,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:25:27,914 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:25:27,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737361076] [2024-11-09 06:25:27,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737361076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:25:27,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:25:27,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:25:27,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354364148] [2024-11-09 06:25:27,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:25:27,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:25:27,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:25:27,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:25:27,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:25:27,920 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:25:28,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:28,141 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-11-09 06:25:28,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:25:28,142 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:25:28,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:28,144 INFO L225 Difference]: With dead ends: 46 [2024-11-09 06:25:28,144 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 06:25:28,144 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:25:28,146 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:25:28,147 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:25:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 06:25:28,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-11-09 06:25:28,159 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:25:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 06:25:28,162 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2024-11-09 06:25:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:28,163 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 06:25:28,163 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:25:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 06:25:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:25:28,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:28,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:25:28,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:25:28,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:25:28,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:28,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:28,366 INFO L85 PathProgramCache]: Analyzing trace with hash -629207983, now seen corresponding path program 1 times [2024-11-09 06:25:28,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:25:28,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272819663] [2024-11-09 06:25:28,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:28,368 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:25:28,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:25:28,371 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:25:28,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:25:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:28,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:25:28,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:25:29,074 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:25:29,074 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:25:29,075 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:25:29,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272819663] [2024-11-09 06:25:29,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272819663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:25:29,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:25:29,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:25:29,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694355168] [2024-11-09 06:25:29,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:25:29,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:25:29,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:25:29,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:25:29,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:25:29,079 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:25:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:29,351 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-09 06:25:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:25:29,352 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:25:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:29,353 INFO L225 Difference]: With dead ends: 40 [2024-11-09 06:25:29,353 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 06:25:29,354 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:25:29,355 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:29,356 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.3s Time] [2024-11-09 06:25:29,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 06:25:29,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-09 06:25:29,363 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:25:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 06:25:29,365 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2024-11-09 06:25:29,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:29,365 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 06:25:29,365 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:25:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 06:25:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:25:29,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:29,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:25:29,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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)] Forceful destruction successful, exit code 0 [2024-11-09 06:25:29,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:25:29,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:25:29,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:29,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1552324308, now seen corresponding path program 1 times [2024-11-09 06:25:29,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:25:29,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573930246] [2024-11-09 06:25:29,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:29,570 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:25:29,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:25:29,577 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:25:29,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:25:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:29,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 06:25:29,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:25:33,540 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:25:33,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:25:43,004 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:25:43,005 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:25:43,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573930246] [2024-11-09 06:25:43,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573930246] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:25:43,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [523158341] [2024-11-09 06:25:43,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:43,007 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:25:43,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:25:43,011 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:25:43,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-09 06:25:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:43,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 06:25:43,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:25:44,472 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:25:44,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:25:45,534 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:25:45,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [523158341] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:25:45,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944215665] [2024-11-09 06:25:45,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:45,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:25:45,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:25:45,539 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:25:45,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:25:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:45,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 06:25:45,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:25:47,008 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:25:47,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:25:48,052 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:25:48,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944215665] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:25:48,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 06:25:48,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9, 9, 10, 10] total 18 [2024-11-09 06:25:48,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991357925] [2024-11-09 06:25:48,053 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 06:25:48,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 06:25:48,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:25:48,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 06:25:48,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-09 06:25:48,055 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:25:52,046 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:25:53,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:25:55,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:25:57,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:26:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:26:00,954 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-11-09 06:26:00,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 06:26:00,955 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:26:00,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:26:00,956 INFO L225 Difference]: With dead ends: 50 [2024-11-09 06:26:00,956 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 06:26:00,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-11-09 06:26:00,958 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 13 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:26:00,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 289 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 118 Invalid, 1 Unknown, 0 Unchecked, 10.0s Time] [2024-11-09 06:26:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 06:26:00,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-09 06:26:00,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 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:26:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-11-09 06:26:00,968 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 13 [2024-11-09 06:26:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:26:00,969 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-11-09 06:26:00,969 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:26:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-09 06:26:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 06:26:00,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:26:00,971 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:26:00,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 06:26:01,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:26:01,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-09 06:26:01,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:26:01,573 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:26:01,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:26:01,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1085797992, now seen corresponding path program 2 times [2024-11-09 06:26:01,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:26:01,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021420737] [2024-11-09 06:26:01,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:26:01,575 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:26:01,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:26:01,579 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:26:01,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b094e0d-c6d3-4d96-b631-f554c35ee467/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:26:22,051 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:26:22,051 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:26:22,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 06:26:22,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:30:37,551 WARN L286 SmtUtils]: Spent 21.64s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:31:00,117 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|)) (.cse6 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse1))))) (let ((.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse6))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse6 .cse5))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse2))))) (and (bvsgt .cse0 (_ bv0 32)) (bvslt .cse1 (_ bv0 32)) (not (= (_ bv0 32) .cse2)) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse2 .cse3)))) (not (bvsge .cse0 .cse3)))))))))) is different from false [2024-11-09 06:31:02,136 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|)) (.cse6 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse1))))) (let ((.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse6))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse6 .cse5))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse2))))) (and (bvsgt .cse0 (_ bv0 32)) (bvslt .cse1 (_ bv0 32)) (not (= (_ bv0 32) .cse2)) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse2 .cse3)))) (not (bvsge .cse0 .cse3)))))))))) is different from true [2024-11-09 06:31:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:31:02,137 INFO L311 TraceCheckSpWp]: Computing backward predicates...