./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_2_7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_7.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 a7443921b0608d3c2ff1c61e12bf7cf129e5c1aecf22f0fb9785817b90c162e7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:23:59,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:23:59,294 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 01:23:59,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:23:59,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:23:59,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:23:59,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:23:59,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:23:59,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:23:59,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:23:59,355 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:23:59,356 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:23:59,357 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:23:59,358 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:23:59,361 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:23:59,361 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:23:59,362 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:23:59,362 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:23:59,363 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:23:59,363 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:23:59,364 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:23:59,364 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:23:59,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:23:59,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:23:59,366 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:23:59,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:23:59,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:23:59,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:23:59,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:23:59,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:23:59,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:23:59,370 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:23:59,370 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:23:59,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:23:59,371 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:23:59,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:23:59,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:23:59,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:23:59,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:23:59,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:23:59,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:23:59,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:23:59,392 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:23:59,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:23:59,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:23:59,393 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:23:59,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:23:59,393 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_66a66391-6a1c-41c4-97dc-e4884e9c059e/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_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 -> a7443921b0608d3c2ff1c61e12bf7cf129e5c1aecf22f0fb9785817b90c162e7 [2024-11-09 01:23:59,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:23:59,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:23:59,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:23:59,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:23:59,849 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:23:59,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/combinations/gcd_3+newton_2_7.i Unable to find full path for "g++" [2024-11-09 01:24:02,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:24:02,514 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:24:02,515 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/sv-benchmarks/c/combinations/gcd_3+newton_2_7.i [2024-11-09 01:24:02,526 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/data/bb02ee7e3/ce515d6c526b4243b2277d418feed387/FLAGb3a40e8f7 [2024-11-09 01:24:02,557 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/data/bb02ee7e3/ce515d6c526b4243b2277d418feed387 [2024-11-09 01:24:02,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:24:02,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:24:02,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:24:02,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:24:02,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:24:02,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:24:02" (1/1) ... [2024-11-09 01:24:02,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab3ec24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:24:02, skipping insertion in model container [2024-11-09 01:24:02,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:24:02" (1/1) ... [2024-11-09 01:24:02,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:24:02,960 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_66a66391-6a1c-41c4-97dc-e4884e9c059e/sv-benchmarks/c/combinations/gcd_3+newton_2_7.i[1226,1239] [2024-11-09 01:24:03,013 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_66a66391-6a1c-41c4-97dc-e4884e9c059e/sv-benchmarks/c/combinations/gcd_3+newton_2_7.i[2841,2854] [2024-11-09 01:24:03,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:24:03,028 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:24:03,046 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_66a66391-6a1c-41c4-97dc-e4884e9c059e/sv-benchmarks/c/combinations/gcd_3+newton_2_7.i[1226,1239] [2024-11-09 01:24:03,065 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_66a66391-6a1c-41c4-97dc-e4884e9c059e/sv-benchmarks/c/combinations/gcd_3+newton_2_7.i[2841,2854] [2024-11-09 01:24:03,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:24:03,092 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:24:03,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:24:03 WrapperNode [2024-11-09 01:24:03,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:24:03,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:24:03,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:24:03,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:24:03,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:24:03" (1/1) ... [2024-11-09 01:24:03,115 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:24:03" (1/1) ... [2024-11-09 01:24:03,150 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2024-11-09 01:24:03,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:24:03,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:24:03,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:24:03,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:24:03,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:24:03" (1/1) ... [2024-11-09 01:24:03,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:24:03" (1/1) ... [2024-11-09 01:24:03,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:24:03" (1/1) ... [2024-11-09 01:24:03,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:24:03" (1/1) ... [2024-11-09 01:24:03,177 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:24:03" (1/1) ... [2024-11-09 01:24:03,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:24:03" (1/1) ... [2024-11-09 01:24:03,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:24:03" (1/1) ... [2024-11-09 01:24:03,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:24:03" (1/1) ... [2024-11-09 01:24:03,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:24:03,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:24:03,189 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:24:03,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:24:03,194 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:24:03" (1/1) ... [2024-11-09 01:24:03,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:24:03,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:24:03,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:24:03,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:24:03,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:24:03,290 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-09 01:24:03,290 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-09 01:24:03,290 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-09 01:24:03,291 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-09 01:24:03,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:24:03,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:24:03,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:24:03,393 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:24:03,396 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:24:03,750 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-09 01:24:03,750 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:24:03,831 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:24:03,832 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 01:24:03,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:24:03 BoogieIcfgContainer [2024-11-09 01:24:03,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:24:03,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:24:03,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:24:03,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:24:03,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:24:02" (1/3) ... [2024-11-09 01:24:03,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666b5fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:24:03, skipping insertion in model container [2024-11-09 01:24:03,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:24:03" (2/3) ... [2024-11-09 01:24:03,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666b5fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:24:03, skipping insertion in model container [2024-11-09 01:24:03,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:24:03" (3/3) ... [2024-11-09 01:24:03,844 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_7.i [2024-11-09 01:24:03,868 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:24:03,869 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 01:24:03,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:24:03,966 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;@20379214, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:24:03,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 01:24:03,971 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 01:24:03,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 01:24:03,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:24:03,979 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:24:03,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:24:03,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:24:03,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1074225707, now seen corresponding path program 1 times [2024-11-09 01:24:03,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:24:03,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838888544] [2024-11-09 01:24:03,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:24:03,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:24:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:24:04,681 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 01:24:04,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:24:04,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838888544] [2024-11-09 01:24:04,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838888544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:24:04,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:24:04,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:24:04,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538909087] [2024-11-09 01:24:04,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:24:04,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:24:04,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:24:04,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:24:04,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:24:04,738 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 01:24:04,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:24:04,888 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-11-09 01:24:04,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:24:04,892 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 01:24:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:24:04,903 INFO L225 Difference]: With dead ends: 39 [2024-11-09 01:24:04,904 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 01:24:04,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:24:04,912 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 01:24:04,914 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 01:24:04,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 01:24:04,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 01:24:04,962 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 01:24:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-09 01:24:04,965 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2024-11-09 01:24:04,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:24:04,966 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-09 01:24:04,966 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 01:24:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-09 01:24:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 01:24:04,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:24:04,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:24:04,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:24:04,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:24:04,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:24:04,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1198724816, now seen corresponding path program 1 times [2024-11-09 01:24:04,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:24:04,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793962478] [2024-11-09 01:24:04,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:24:04,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:24:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:24:05,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2131238788] [2024-11-09 01:24:05,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:24:05,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:24:05,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:24:05,043 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:24:05,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:24:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:24:05,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:24:05,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:24:09,107 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 01:24:22,295 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 01:24:22,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:24:37,722 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 01:24:37,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:24:37,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793962478] [2024-11-09 01:24:37,723 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:24:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131238788] [2024-11-09 01:24:37,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131238788] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:24:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [102560605] [2024-11-09 01:24:37,760 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 01:24:37,761 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:24:37,766 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:24:37,774 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:24:37,775 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:24:39,075 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:24:51,159 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '180#(<= 1 |#StackHeapBarrier|)' at error location [2024-11-09 01:24:51,160 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:24:51,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:24:51,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2024-11-09 01:24:51,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472535989] [2024-11-09 01:24:51,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:24:51,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:24:51,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:24:51,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:24:51,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=212, Unknown=12, NotChecked=30, Total=306 [2024-11-09 01:24:51,165 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 01:24:53,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 01:24:55,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 01:24:56,000 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (< |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse0 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse1 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (not .cse0) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse1) .cse2) (or (< |c_ULTIMATE.start_gcd_test_~b#1| .cse1) .cse2 (let ((.cse3 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (and (or (not (= (mod .cse3 256) 0)) (and (<= .cse4 0) (not (= .cse3 0)))) (or (not (= (mod (+ .cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 0)) (< 0 .cse4))))) (let ((.cse11 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse5 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse12 (<= .cse1 0)) (.cse10 (<= .cse11 127)) (.cse9 (<= 128 .cse11)) (.cse8 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse6 (+ .cse11 (- 256)))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))) .cse5) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) .cse5) (and (or (and (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (= (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (let ((.cse7 (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= .cse7 0)) (= (mod (+ .cse7 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_24|)) 256) .cse8))))) .cse9) (and .cse10 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse11 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) .cse12) (and .cse12 (or (and .cse10 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse11 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) (and .cse9 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (let ((.cse13 (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= (mod (+ .cse13 |v_ULTIMATE.start_gcd_test_~b#1_24|) 256) .cse8) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (not (= .cse13 0))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (= (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0))) .cse0)))))))))) is different from true [2024-11-09 01:24:58,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 01:25:01,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 01:25:01,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:25:01,826 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-11-09 01:25:01,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:25:01,827 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 01:25:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:25:01,828 INFO L225 Difference]: With dead ends: 34 [2024-11-09 01:25:01,829 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 01:25:01,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=54, Invalid=213, Unknown=13, NotChecked=62, Total=342 [2024-11-09 01:25:01,832 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:25:01,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 112 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 10 Unknown, 53 Unchecked, 10.6s Time] [2024-11-09 01:25:01,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 01:25:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 01:25:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 01:25:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-09 01:25:01,842 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 9 [2024-11-09 01:25:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:25:01,842 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-09 01:25:01,843 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 01:25:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-11-09 01:25:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 01:25:01,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:25:01,844 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:25:01,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:25:02,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:25:02,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:25:02,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:25:02,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1228259416, now seen corresponding path program 1 times [2024-11-09 01:25:02,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:25:02,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043829191] [2024-11-09 01:25:02,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:25:02,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:25:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:25:02,166 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:25:02,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043829191] [2024-11-09 01:25:02,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043829191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:25:02,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:25:02,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:25:02,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866512055] [2024-11-09 01:25:02,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:25:02,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:25:02,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:25:02,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:25:02,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:25:02,172 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:25:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:25:02,278 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-11-09 01:25:02,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:25:02,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 01:25:02,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:25:02,281 INFO L225 Difference]: With dead ends: 32 [2024-11-09 01:25:02,281 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 01:25:02,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:25:02,284 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:25:02,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:25:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 01:25:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 01:25:02,300 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 01:25:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-09 01:25:02,302 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2024-11-09 01:25:02,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:25:02,303 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-09 01:25:02,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:25:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-09 01:25:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 01:25:02,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:25:02,305 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:25:02,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:25:02,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:25:02,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:25:02,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1850413146, now seen corresponding path program 2 times [2024-11-09 01:25:02,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:25:02,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671599074] [2024-11-09 01:25:02,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:25:02,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:25:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:25:02,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443447106] [2024-11-09 01:25:02,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 01:25:02,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:25:02,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:25:02,401 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:25:02,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:25:02,508 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 01:25:02,508 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:25:02,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 01:25:02,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:25:07,932 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse8 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse7 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse4 (+ .cse2 (- 256))) (.cse5 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse3 (<= 128 .cse2)) (.cse1 (<= .cse2 127)) (.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|))) .cse0) (and (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_36|))))) (and .cse3 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_36|) 0) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0))) .cse5) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse6 (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod (+ .cse6 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) .cse7) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse6 0)))))))) .cse8) (and .cse8 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse9 (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= .cse9 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse7 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse9) 256))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_36|) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse5)) .cse3) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse0)))) is different from true [2024-11-09 01:25:11,164 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (let ((.cse7 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse5 (+ .cse7 (- 256))) (.cse2 (<= 128 .cse7)) (.cse6 (<= .cse7 127)) (.cse1 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|))) .cse0) (and .cse1 (or (and .cse2 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse3 (mod .cse5 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod (+ .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) .cse4) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse3 0)))))) (and .cse6 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse0) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse8 (mod .cse5 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= .cse8 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse4 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse8) 256))))) .cse2) (and .cse6 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) .cse1))))) is different from true [2024-11-09 01:25:19,260 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse8 (<= .cse10 127)) (.cse1 (<= 128 .cse10)) (.cse3 (+ .cse10 (- 256))) (.cse5 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse4 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse25 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and .cse1 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse2 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse2 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse2 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse7 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= .cse5 (mod (+ .cse6 .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256)) (not (= .cse6 0)) (not (= .cse7 0)))))))) (and .cse8 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse9 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse9) 0) (not (= .cse9 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse12 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse12))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse11 0)) (= (mod (+ (* 255 .cse12) .cse11) 256) .cse5) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse12 0)))))))))) (and .cse0 (or (and .cse8 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse13 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse13)) (not (= .cse13 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse15 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse15))) (and (not (= .cse14 0)) (= (mod (+ (* 255 .cse15) .cse14) 256) .cse5) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse15 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse16 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse16) 0) (not (= .cse16 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse4))) (and .cse1 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (.cse18 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ .cse19 .cse18) 256))))) (and (not (= .cse17 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse18 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod (+ .cse17 .cse19 .cse18) 256) .cse5))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse20 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse20) 256))) 0) (not (= .cse20 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse21 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse21) 256))) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse21 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse23 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse23))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse22 0)) (= (mod (+ (* .cse23 255) .cse22) 256) .cse5) (not (= .cse23 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)))))) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse24 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse24 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse24) 0)))))) .cse25) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse27 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse27))) (and (not (= .cse26 0)) (= (mod (+ (* .cse27 255) .cse26) 256) .cse5) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse27 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse28 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse28) 0)))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse29 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse29) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) .cse25)))) is different from true [2024-11-09 01:25:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2024-11-09 01:25:37,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:26:17,831 WARN L286 SmtUtils]: Spent 7.90s on a formula simplification. DAG size of input: 86 DAG size of output: 82 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:26:31,167 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 01:26:31,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:26:31,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671599074] [2024-11-09 01:26:31,168 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:26:31,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443447106] [2024-11-09 01:26:31,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443447106] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:26:31,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [954737207] [2024-11-09 01:26:31,173 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 01:26:31,173 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:26:31,173 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:26:31,173 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:26:31,174 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:26:31,543 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:26:35,096 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '447#(<= 1 |#StackHeapBarrier|)' at error location [2024-11-09 01:26:35,097 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:26:35,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:26:35,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-11-09 01:26:35,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984844482] [2024-11-09 01:26:35,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:26:35,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 01:26:35,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:26:35,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 01:26:35,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=278, Unknown=15, NotChecked=108, Total=462 [2024-11-09 01:26:35,100 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:26:35,773 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse36 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse13 (mod (+ .cse36 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse1 (mod .cse36 256))) (let ((.cse15 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse11 (< 127 .cse1)) (.cse4 (= .cse36 0)) (.cse12 (< .cse1 128)) (.cse3 (< 127 .cse13)) (.cse10 (< 127 .cse14)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse7 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse2 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse16 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (let ((.cse8 (< .cse14 .cse2)) (.cse9 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse6 (< .cse13 .cse2))) (and (or (and (or .cse0 (< .cse1 .cse2)) (or .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse4 .cse8 .cse9 .cse10 .cse7)) .cse11) (or .cse12 (and (or .cse8 .cse9 .cse10 .cse7) (or .cse3 .cse5 .cse6 .cse7))))) .cse15 .cse16) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse2) .cse16) (let ((.cse19 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse24 (<= .cse2 0)) (.cse23 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse21 (+ .cse19 (- 256))) (.cse20 (<= 128 .cse19)) (.cse18 (<= .cse19 127)) (.cse17 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|))) .cse17) (and (or (and .cse18 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse19 |v_ULTIMATE.start_gcd_test_~b#1_36|))))) (and .cse20 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|) 0) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0))) .cse15) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse22 (mod .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod (+ .cse22 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) .cse23) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse22 0)))))))) .cse24) (and .cse24 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse25 (mod .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= .cse25 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse23 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse25) 256))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse15)) .cse20) (and .cse18 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse19 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse17)))) (or (let ((.cse27 (= .cse13 0)) (.cse28 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse13) .cse2) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))))) (let ((.cse30 (or .cse27 .cse7 .cse28)) (.cse31 (< .cse13 128)) (.cse29 (< .cse14 128)) (.cse32 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0) (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse13)) .cse2))))) (and (or .cse11 (let ((.cse26 (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse1) .cse2) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse1 0)))) (and (or .cse3 (and (or (and .cse26 (or .cse4 .cse27 .cse7 .cse28)) .cse29) (or (and .cse26 .cse30) .cse10))) (or .cse31 (and (or .cse4 .cse32 .cse7) .cse26))))) (or .cse12 (let ((.cse34 (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse1)) .cse2) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0)))))) (and (or .cse3 (let ((.cse33 (and .cse30 .cse34))) (and (or .cse10 .cse33) (or .cse29 .cse33)))) (or .cse31 (let ((.cse35 (and (or .cse32 .cse7) .cse34))) (and (or .cse29 .cse35) (or .cse10 .cse35)))))))))) .cse16))))) is different from false [2024-11-09 01:26:36,000 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse35 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod (+ .cse35 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse30 (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse24 (mod .cse35 256))) (let ((.cse23 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse14 (= .cse35 0)) (.cse11 (< 127 .cse24)) (.cse25 (< .cse24 128)) (.cse20 (< 127 .cse30)) (.cse12 (< 127 .cse29)) (.cse16 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse1 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse0) .cse1) (let ((.cse9 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse2 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse6 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse7 (+ .cse9 (- 256))) (.cse4 (<= 128 .cse9)) (.cse8 (<= .cse9 127)) (.cse3 (<= .cse0 0))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|))) .cse2) (and .cse3 (or (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse5 (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod (+ .cse5 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) .cse6) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse5 0)))))) (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_36|))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse2) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse10 (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= .cse10 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse6 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse10) 256))))) .cse4) (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) .cse3)))) (or (let ((.cse15 (= .cse29 0)) (.cse17 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse29) .cse0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))))) (let ((.cse19 (or .cse15 .cse16 .cse17)) (.cse21 (< .cse29 128)) (.cse18 (< .cse30 128)) (.cse22 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0) (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse29)) .cse0))))) (and (or .cse11 (let ((.cse13 (or .cse23 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse24) .cse0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse24 0)))) (and (or .cse12 (and (or (and .cse13 (or .cse14 .cse15 .cse16 .cse17)) .cse18) (or (and .cse13 .cse19) .cse20))) (or .cse21 (and (or .cse14 .cse22 .cse16) .cse13))))) (or .cse25 (let ((.cse27 (or .cse23 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse24)) .cse0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0)))))) (and (or .cse12 (let ((.cse26 (and .cse19 .cse27))) (and (or .cse20 .cse26) (or .cse18 .cse26)))) (or .cse21 (let ((.cse28 (and (or .cse22 .cse16) .cse27))) (and (or .cse18 .cse28) (or .cse20 .cse28)))))))))) .cse1) (or (let ((.cse33 (< .cse30 .cse0)) (.cse34 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse31 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse32 (< .cse29 .cse0))) (and (or (and (or .cse23 (< .cse24 .cse0)) (or .cse12 .cse14 .cse31 .cse32 .cse16) (or .cse14 .cse33 .cse34 .cse20 .cse16)) .cse11) (or .cse25 (and (or .cse33 .cse34 .cse20 .cse16) (or .cse12 .cse31 .cse32 .cse16))))) .cse1))))) is different from false [2024-11-09 01:26:38,494 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse35 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod (+ .cse35 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse30 (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse24 (mod .cse35 256))) (let ((.cse23 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse14 (= .cse35 0)) (.cse11 (< 127 .cse24)) (.cse25 (< .cse24 128)) (.cse20 (< 127 .cse30)) (.cse12 (< 127 .cse29)) (.cse16 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse1 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse0) .cse1) (let ((.cse9 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse2 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse6 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse7 (+ .cse9 (- 256))) (.cse4 (<= 128 .cse9)) (.cse8 (<= .cse9 127)) (.cse3 (<= .cse0 0))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|))) .cse2) (and .cse3 (or (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse5 (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod (+ .cse5 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) .cse6) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse5 0)))))) (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_36|))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse2) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse10 (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= .cse10 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse6 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse10) 256))))) .cse4) (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) .cse3)))) (or (let ((.cse15 (= .cse29 0)) (.cse17 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse29) .cse0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))))) (let ((.cse19 (or .cse15 .cse16 .cse17)) (.cse21 (< .cse29 128)) (.cse18 (< .cse30 128)) (.cse22 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0) (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse29)) .cse0))))) (and (or .cse11 (let ((.cse13 (or .cse23 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse24) .cse0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse24 0)))) (and (or .cse12 (and (or (and .cse13 (or .cse14 .cse15 .cse16 .cse17)) .cse18) (or (and .cse13 .cse19) .cse20))) (or .cse21 (and (or .cse14 .cse22 .cse16) .cse13))))) (or .cse25 (let ((.cse27 (or .cse23 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse24)) .cse0) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0)))))) (and (or .cse12 (let ((.cse26 (and .cse19 .cse27))) (and (or .cse20 .cse26) (or .cse18 .cse26)))) (or .cse21 (let ((.cse28 (and (or .cse22 .cse16) .cse27))) (and (or .cse18 .cse28) (or .cse20 .cse28)))))))))) .cse1) (or (let ((.cse33 (< .cse30 .cse0)) (.cse34 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse31 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse32 (< .cse29 .cse0))) (and (or (and (or .cse23 (< .cse24 .cse0)) (or .cse12 .cse14 .cse31 .cse32 .cse16) (or .cse14 .cse33 .cse34 .cse20 .cse16)) .cse11) (or .cse25 (and (or .cse33 .cse34 .cse20 .cse16) (or .cse12 .cse31 .cse32 .cse16))))) .cse1))))) is different from true [2024-11-09 01:26:38,611 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse13 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse1 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse14 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (let ((.cse10 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (mod (+ .cse10 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse12 (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse0 (mod .cse10 256)) (.cse7 (< .cse12 .cse1)) (.cse8 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse9 (< 127 .cse12)) (.cse2 (< 127 .cse11)) (.cse4 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse5 (< .cse11 .cse1)) (.cse6 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)))) (and (or (let ((.cse3 (= .cse10 0))) (and (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (< .cse0 .cse1)) (or .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse3 .cse7 .cse8 .cse9 .cse6))) (< 127 .cse0)) (or (< .cse0 128) (and (or .cse7 .cse8 .cse9 .cse6) (or .cse2 .cse4 .cse5 .cse6))))))) .cse13 .cse14) (let ((.cse24 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse15 (<= .cse1 0)) (.cse22 (<= .cse24 127)) (.cse16 (<= 128 .cse24)) (.cse18 (+ .cse24 (- 256))) (.cse19 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse39 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse15 (or (and .cse16 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse17 (mod .cse18 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse17 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse17 0))))) .cse13) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse21 (mod .cse18 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= .cse19 (mod (+ .cse20 .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256)) (not (= .cse20 0)) (not (= .cse21 0)))))))) (and .cse22 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse23 (mod .cse24 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse23) 0) (not (= .cse23 0))))) .cse13) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse26 (mod .cse24 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse26))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse25 0)) (= (mod (+ (* 255 .cse26) .cse25) 256) .cse19) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse26 0)))))))))) (and .cse15 (or (and .cse22 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse27 (mod .cse24 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse27)) (not (= .cse27 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse29 (mod .cse24 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse29))) (and (not (= .cse28 0)) (= (mod (+ (* 255 .cse29) .cse28) 256) .cse19) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse29 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse30 (mod .cse24 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse30) 0) (not (= .cse30 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse13))) (and .cse16 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse33 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (.cse32 (mod .cse18 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ .cse33 .cse32) 256))))) (and (not (= .cse31 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse32 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod (+ .cse31 .cse33 .cse32) 256) .cse19))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse34 (mod .cse18 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse34) 256))) 0) (not (= .cse34 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse13) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse35 (mod .cse18 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse35) 256))) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse35 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse37 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse37))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse36 0)) (= (mod (+ (* .cse37 255) .cse36) 256) .cse19) (not (= .cse37 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)))))) (and .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse38 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse38 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse38) 0)))))) .cse39) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| 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_36|))) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse41))) (and (not (= .cse40 0)) (= (mod (+ (* .cse41 255) .cse40) 256) .cse19) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse41 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse42 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse42 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse42) 0)))) .cse13) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse43 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse43 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse43) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) .cse39)))) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse1) .cse14) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse1) .cse14))) is different from true [2024-11-09 01:26:39,017 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse30 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse31 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (let ((.cse10 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= .cse30 0)) (.cse8 (<= .cse10 127)) (.cse1 (<= 128 .cse10)) (.cse3 (+ .cse10 (- 256))) (.cse5 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse4 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse25 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and .cse1 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse2 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse2 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse2 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse7 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= .cse5 (mod (+ .cse6 .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256)) (not (= .cse6 0)) (not (= .cse7 0)))))))) (and .cse8 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse9 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse9) 0) (not (= .cse9 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse12 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse12))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse11 0)) (= (mod (+ (* 255 .cse12) .cse11) 256) .cse5) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse12 0)))))))))) (and .cse0 (or (and .cse8 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse13 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse13)) (not (= .cse13 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse15 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse15))) (and (not (= .cse14 0)) (= (mod (+ (* 255 .cse15) .cse14) 256) .cse5) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse15 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse16 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse16) 0) (not (= .cse16 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse4))) (and .cse1 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (.cse18 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ .cse19 .cse18) 256))))) (and (not (= .cse17 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse18 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod (+ .cse17 .cse19 .cse18) 256) .cse5))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse20 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse20) 256))) 0) (not (= .cse20 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse21 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse21) 256))) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse21 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse23 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse23))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse22 0)) (= (mod (+ (* .cse23 255) .cse22) 256) .cse5) (not (= .cse23 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)))))) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse24 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse24 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse24) 0)))))) .cse25) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse27 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse27))) (and (not (= .cse26 0)) (= (mod (+ (* .cse27 255) .cse26) 256) .cse5) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse27 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse28 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse28) 0)))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse29 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse29) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) .cse25)))) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse30) .cse31) (or (let ((.cse41 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse43 (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse32 (mod .cse41 256)) (.cse38 (< .cse43 .cse30)) (.cse39 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse40 (< 127 .cse43)) (.cse33 (< 127 .cse42)) (.cse35 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse36 (< .cse42 .cse30)) (.cse37 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)))) (and (or (let ((.cse34 (= .cse41 0))) (and (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (< .cse32 .cse30)) (or .cse33 .cse34 .cse35 .cse36 .cse37) (or .cse34 .cse38 .cse39 .cse40 .cse37))) (< 127 .cse32)) (or (< .cse32 128) (and (or .cse38 .cse39 .cse40 .cse37) (or .cse33 .cse35 .cse36 .cse37))))))) .cse31))) is different from true [2024-11-09 01:26:39,324 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse30 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (let ((.cse8 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse15 (+ .cse8 (- 256))) (.cse12 (<= 128 .cse8)) (.cse11 (<= .cse8 127)) (.cse17 (<= .cse30 0)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse2 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse2 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse2) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse5 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse5))) (and (not (= .cse3 0)) (= .cse4 (mod (+ (* .cse5 255) .cse3) 256)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse5 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse6 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse6 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse6) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) (and (or (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse7 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse7) 0) (not (= .cse7 0))))) .cse1) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse10 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse10))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse9 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse10 0)) (= .cse4 (mod (+ (* 255 .cse10) .cse9) 256))))))) .cse11) (and .cse12 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse14 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse14 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= .cse4 (mod (+ .cse13 .cse14 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse13 0)) (not (= .cse14 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse16 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse16 0))))) .cse1)))) .cse17) (and (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse18 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse18 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse18) 256))) |c_ULTIMATE.start_gcd_test_~a#1|)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse20 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (.cse21 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ .cse20 .cse21) 256))))) (and (= .cse4 (mod (+ .cse19 .cse20 .cse21) 256)) (not (= .cse19 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse21 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse22 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse22) 256))) 0) (not (= .cse22 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) .cse12) (and .cse11 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse24 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse24))) (and (not (= .cse23 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse24 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse4 (mod (+ (* 255 .cse24) .cse23) 256)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse25 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse25 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse25)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse26 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse26) 0) (not (= .cse26 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse1)))) .cse17) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse28))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse27 0)) (= .cse4 (mod (+ (* .cse28 255) .cse27) 256)) (not (= .cse28 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)))))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse29 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse29) 0)))))) .cse0)))) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse30) (< |c_ULTIMATE.start_main1_~x~0#1| 1)))) is different from true [2024-11-09 01:26:40,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:40,446 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-11-09 01:26:40,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 01:26:40,448 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 01:26:40,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:40,449 INFO L225 Difference]: With dead ends: 39 [2024-11-09 01:26:40,449 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 01:26:40,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 49.5s TimeCoverageRelationStatistics Valid=71, Invalid=282, Unknown=21, NotChecked=328, Total=702 [2024-11-09 01:26:40,451 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:40,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 6 Unknown, 174 Unchecked, 1.9s Time] [2024-11-09 01:26:40,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 01:26:40,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-09 01:26:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 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 01:26:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2024-11-09 01:26:40,471 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 13 [2024-11-09 01:26:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:40,471 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-11-09 01:26:40,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:26:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2024-11-09 01:26:40,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 01:26:40,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:40,473 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:26:40,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:26:40,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:26:40,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:40,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:40,675 INFO L85 PathProgramCache]: Analyzing trace with hash 235847532, now seen corresponding path program 1 times [2024-11-09 01:26:40,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:26:40,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418351528] [2024-11-09 01:26:40,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:40,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:26:40,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:26:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:26:40,715 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 01:26:40,716 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:26:40,717 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-09 01:26:40,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-09 01:26:40,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:26:40,725 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-11-09 01:26:40,748 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:26:40,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:26:40 BoogieIcfgContainer [2024-11-09 01:26:40,752 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:26:40,753 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:26:40,753 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:26:40,753 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:26:40,754 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:24:03" (3/4) ... [2024-11-09 01:26:40,757 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:26:40,759 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:26:40,760 INFO L158 Benchmark]: Toolchain (without parser) took 158195.99ms. Allocated memory was 132.1MB in the beginning and 224.4MB in the end (delta: 92.3MB). Free memory was 69.9MB in the beginning and 157.6MB in the end (delta: -87.7MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-11-09 01:26:40,760 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 132.1MB. Free memory is still 106.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:26:40,761 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.25ms. Allocated memory was 132.1MB in the beginning and 182.5MB in the end (delta: 50.3MB). Free memory was 69.8MB in the beginning and 148.0MB in the end (delta: -78.2MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-11-09 01:26:40,761 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.45ms. Allocated memory is still 182.5MB. Free memory was 148.0MB in the beginning and 145.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:26:40,762 INFO L158 Benchmark]: Boogie Preprocessor took 36.72ms. Allocated memory is still 182.5MB. Free memory was 145.9MB in the beginning and 145.0MB in the end (delta: 931.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:26:40,762 INFO L158 Benchmark]: RCFGBuilder took 644.38ms. Allocated memory is still 182.5MB. Free memory was 145.0MB in the beginning and 142.3MB in the end (delta: 2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 01:26:40,763 INFO L158 Benchmark]: TraceAbstraction took 156916.49ms. Allocated memory was 182.5MB in the beginning and 224.4MB in the end (delta: 41.9MB). Free memory was 141.3MB in the beginning and 157.6MB in the end (delta: -16.3MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2024-11-09 01:26:40,763 INFO L158 Benchmark]: Witness Printer took 6.69ms. Allocated memory is still 224.4MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:26:40,765 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.33ms. Allocated memory is still 132.1MB. Free memory is still 106.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.25ms. Allocated memory was 132.1MB in the beginning and 182.5MB in the end (delta: 50.3MB). Free memory was 69.8MB in the beginning and 148.0MB in the end (delta: -78.2MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.45ms. Allocated memory is still 182.5MB. Free memory was 148.0MB in the beginning and 145.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.72ms. Allocated memory is still 182.5MB. Free memory was 145.9MB in the beginning and 145.0MB in the end (delta: 931.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 644.38ms. Allocated memory is still 182.5MB. Free memory was 145.0MB in the beginning and 142.3MB in the end (delta: 2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 156916.49ms. Allocated memory was 182.5MB in the beginning and 224.4MB in the end (delta: 41.9MB). Free memory was 141.3MB in the beginning and 157.6MB in the end (delta: -16.3MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * Witness Printer took 6.69ms. Allocated memory is still 224.4MB. Free memory is still 157.6MB. 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 > -1.4f && IN < 1.4f) [L75] COND FALSE !(!cond) [L91] RET assume_abort_if_not(IN > -1.4f && IN < 1.4f) [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: 156.8s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 12.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 335 SdHoareTripleChecker+Invalid, 10.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 227 IncrementalHoareTripleChecker+Unchecked, 270 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 230 IncrementalHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 65 mSDtfsCounter, 230 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 89.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=4, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 121.9s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 55 ConstructedInterpolants, 12 QuantifiedInterpolants, 7303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2/22 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:26:40,989 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-09 01:26:41,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_7.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 a7443921b0608d3c2ff1c61e12bf7cf129e5c1aecf22f0fb9785817b90c162e7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:26:43,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:26:43,801 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 01:26:43,809 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:26:43,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:26:43,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:26:43,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:26:43,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:26:43,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:26:43,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:26:43,859 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:26:43,859 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:26:43,860 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:26:43,865 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:26:43,866 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:26:43,866 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:26:43,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:26:43,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:26:43,868 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:26:43,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:26:43,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:26:43,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:26:43,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:26:43,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:26:43,873 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:26:43,873 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:26:43,873 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:26:43,874 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:26:43,874 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:26:43,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:26:43,875 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:26:43,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:26:43,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:26:43,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:26:43,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:26:43,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:26:43,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:26:43,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:26:43,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:26:43,880 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 01:26:43,881 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:26:43,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:26:43,900 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:26:43,900 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_66a66391-6a1c-41c4-97dc-e4884e9c059e/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_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 -> a7443921b0608d3c2ff1c61e12bf7cf129e5c1aecf22f0fb9785817b90c162e7 [2024-11-09 01:26:44,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:26:44,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:26:44,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:26:44,407 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:26:44,408 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:26:44,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/combinations/gcd_3+newton_2_7.i Unable to find full path for "g++" [2024-11-09 01:26:46,502 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:26:46,723 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:26:46,724 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/sv-benchmarks/c/combinations/gcd_3+newton_2_7.i [2024-11-09 01:26:46,736 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/data/310faab1c/09d019c393ed4b85a9a3f768873bfc53/FLAG121eb10f7 [2024-11-09 01:26:47,068 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/data/310faab1c/09d019c393ed4b85a9a3f768873bfc53 [2024-11-09 01:26:47,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:26:47,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:26:47,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:47,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:26:47,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:26:47,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e73ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47, skipping insertion in model container [2024-11-09 01:26:47,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:26:47,362 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_66a66391-6a1c-41c4-97dc-e4884e9c059e/sv-benchmarks/c/combinations/gcd_3+newton_2_7.i[1226,1239] [2024-11-09 01:26:47,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/sv-benchmarks/c/combinations/gcd_3+newton_2_7.i[2841,2854] [2024-11-09 01:26:47,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:47,432 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:26:47,450 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_66a66391-6a1c-41c4-97dc-e4884e9c059e/sv-benchmarks/c/combinations/gcd_3+newton_2_7.i[1226,1239] [2024-11-09 01:26:47,477 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_66a66391-6a1c-41c4-97dc-e4884e9c059e/sv-benchmarks/c/combinations/gcd_3+newton_2_7.i[2841,2854] [2024-11-09 01:26:47,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:47,505 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:26:47,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47 WrapperNode [2024-11-09 01:26:47,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:47,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:47,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:26:47,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:26:47,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,560 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2024-11-09 01:26:47,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:47,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:26:47,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:26:47,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:26:47,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:26:47,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:26:47,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:26:47,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:26:47,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:26:47,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:26:47,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:26:47,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:26:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:26:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 01:26:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-09 01:26:47,703 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-09 01:26:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-09 01:26:47,705 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-09 01:26:47,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:26:47,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:26:47,885 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:26:47,891 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:26:55,156 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-09 01:26:55,156 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:26:55,173 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:26:55,173 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 01:26:55,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:55 BoogieIcfgContainer [2024-11-09 01:26:55,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:26:55,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:26:55,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:26:55,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:26:55,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:26:47" (1/3) ... [2024-11-09 01:26:55,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3041cc84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:55, skipping insertion in model container [2024-11-09 01:26:55,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (2/3) ... [2024-11-09 01:26:55,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3041cc84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:55, skipping insertion in model container [2024-11-09 01:26:55,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:55" (3/3) ... [2024-11-09 01:26:55,187 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_7.i [2024-11-09 01:26:55,216 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:26:55,216 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 01:26:55,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:26:55,297 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;@498f1b7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:26:55,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 01:26:55,302 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 01:26:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 01:26:55,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:55,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:26:55,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:55,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:55,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1594868719, now seen corresponding path program 1 times [2024-11-09 01:26:55,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:26:55,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589077366] [2024-11-09 01:26:55,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:55,331 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 01:26:55,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:26:55,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 01:26:55,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 01:26:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:55,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:26:55,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:55,630 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 01:26:55,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:26:55,632 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:26:55,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589077366] [2024-11-09 01:26:55,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589077366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:55,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:55,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:26:55,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129749171] [2024-11-09 01:26:55,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:55,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:26:55,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:26:55,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:26:55,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:26:55,678 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 01:26:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:55,845 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2024-11-09 01:26:55,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:26:55,849 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 01:26:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:55,856 INFO L225 Difference]: With dead ends: 70 [2024-11-09 01:26:55,856 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 01:26:55,859 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 01:26:55,864 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:55,865 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.1s Time] [2024-11-09 01:26:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 01:26:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 01:26:55,907 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 01:26:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-09 01:26:55,910 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2024-11-09 01:26:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:55,911 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-09 01:26:55,911 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 01:26:55,912 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-09 01:26:55,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 01:26:55,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:55,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:26:55,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 01:26:56,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 01:26:56,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:56,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:56,117 INFO L85 PathProgramCache]: Analyzing trace with hash 180138643, now seen corresponding path program 1 times [2024-11-09 01:26:56,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:26:56,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970403165] [2024-11-09 01:26:56,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:56,119 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 01:26:56,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:26:56,125 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 01:26:56,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 01:26:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:56,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:26:56,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:56,372 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 01:26:56,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:26:56,373 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:26:56,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970403165] [2024-11-09 01:26:56,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970403165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:56,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:56,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:26:56,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154935961] [2024-11-09 01:26:56,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:56,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:26:56,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:26:56,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:26:56,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:26:56,379 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 01:26:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:56,590 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-11-09 01:26:56,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:26:56,592 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 01:26:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:56,594 INFO L225 Difference]: With dead ends: 46 [2024-11-09 01:26:56,594 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 01:26:56,595 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 01:26:56,596 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 01:26:56,597 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 01:26:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 01:26:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-11-09 01:26:56,606 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 01:26:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 01:26:56,609 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2024-11-09 01:26:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:56,610 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 01:26:56,610 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 01:26:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 01:26:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 01:26:56,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:56,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:26:56,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 01:26:56,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 01:26:56,812 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:56,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:56,813 INFO L85 PathProgramCache]: Analyzing trace with hash -629207983, now seen corresponding path program 1 times [2024-11-09 01:26:56,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:26:56,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134713121] [2024-11-09 01:26:56,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:56,814 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 01:26:56,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:26:56,817 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 01:26:56,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 01:26:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:56,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:26:56,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:57,489 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 01:26:57,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:26:57,490 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:26:57,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134713121] [2024-11-09 01:26:57,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134713121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:57,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:57,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:26:57,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330303268] [2024-11-09 01:26:57,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:57,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:26:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:26:57,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:26:57,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:26:57,498 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 01:26:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:57,768 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-09 01:26:57,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:26:57,770 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 01:26:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:57,771 INFO L225 Difference]: With dead ends: 40 [2024-11-09 01:26:57,771 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 01:26:57,772 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 01:26:57,773 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:57,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:26:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 01:26:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-09 01:26:57,780 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 01:26:57,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 01:26:57,782 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2024-11-09 01:26:57,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:57,782 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 01:26:57,783 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 01:26:57,783 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 01:26:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 01:26:57,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:57,784 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:26:57,791 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 01:26:57,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 01:26:57,985 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:57,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:57,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1552324308, now seen corresponding path program 1 times [2024-11-09 01:26:57,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:26:57,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315693680] [2024-11-09 01:26:57,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:57,987 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 01:26:57,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:26:57,990 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 01:26:57,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 01:26:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:58,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 01:26:58,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:01,842 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 01:27:01,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:09,757 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 01:27:09,757 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:09,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315693680] [2024-11-09 01:27:09,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315693680] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:09,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [315198776] [2024-11-09 01:27:09,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:09,758 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:27:09,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:27:09,762 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:27:09,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-09 01:27:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:10,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 01:27:10,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:11,118 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 01:27:11,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:12,003 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 01:27:12,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [315198776] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:12,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599532418] [2024-11-09 01:27:12,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:12,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:12,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:27:12,006 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:27:12,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 01:27:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:12,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 01:27:12,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:13,876 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 01:27:13,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:14,881 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 01:27:14,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599532418] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:14,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 01:27:14,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9, 9, 10, 10] total 18 [2024-11-09 01:27:14,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262486054] [2024-11-09 01:27:14,882 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 01:27:14,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 01:27:14,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:27:14,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 01:27:14,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:27:14,885 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 01:27:18,450 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 01:27:19,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 01:27:21,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 01:27:24,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 01:27:24,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:24,993 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-11-09 01:27:24,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 01:27:24,994 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 01:27:24,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:24,995 INFO L225 Difference]: With dead ends: 48 [2024-11-09 01:27:24,995 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 01:27:24,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:27:24,996 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:24,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 289 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 118 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time] [2024-11-09 01:27:24,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 01:27:25,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-11-09 01:27:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 01:27:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-09 01:27:25,006 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 13 [2024-11-09 01:27:25,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:25,007 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-09 01:27:25,007 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 01:27:25,007 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-09 01:27:25,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 01:27:25,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:25,009 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:25,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 01:27:25,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:25,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:25,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 01:27:25,614 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:25,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:25,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1058982499, now seen corresponding path program 2 times [2024-11-09 01:27:25,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:25,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065091993] [2024-11-09 01:27:25,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 01:27:25,615 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 01:27:25,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:25,619 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 01:27:25,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/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 01:27:32,251 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 01:27:32,251 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:27:32,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 01:27:32,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:30:13,391 WARN L286 SmtUtils]: Spent 16.72s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:30:29,960 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~b#1_32| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_14| (_ BitVec 8))) (let ((.cse1 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~b#1_32|))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_14|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse1))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse5))))) (let ((.cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse3))))) (and (bvsgt .cse0 (_ bv0 32)) (bvslt .cse1 (_ bv0 32)) (not (bvsge .cse0 .cse2)) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse2))))))))))) is different from false [2024-11-09 01:30:31,984 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~b#1_32| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_14| (_ BitVec 8))) (let ((.cse1 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~b#1_32|))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_14|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse1))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse5))))) (let ((.cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse3))))) (and (bvsgt .cse0 (_ bv0 32)) (bvslt .cse1 (_ bv0 32)) (not (bvsge .cse0 .cse2)) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse2))))))))))) is different from true [2024-11-09 01:30:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:30:31,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:34:39,944 WARN L286 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:35:00,034 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_15| (_ BitVec 8))) (let ((.cse2 ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_15|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse2))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse0))))) (or (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse1))))) (not (bvslt .cse2 (_ bv0 32))) (bvsge .cse3 .cse1) (not (bvsgt .cse3 (_ bv0 32)))))))))) is different from false [2024-11-09 01:35:02,056 WARN L873 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_15| (_ BitVec 8))) (let ((.cse2 ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_15|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse2))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse0))))) (or (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse1))))) (not (bvslt .cse2 (_ bv0 32))) (bvsge .cse3 .cse1) (not (bvsgt .cse3 (_ bv0 32)))))))))) is different from true [2024-11-09 01:35:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:35:16,681 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:35:16,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065091993] [2024-11-09 01:35:16,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065091993] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:35:16,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1161604701] [2024-11-09 01:35:16,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 01:35:16,682 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:35:16,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:35:16,683 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:35:16,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-09 01:35:17,343 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 01:35:17,343 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:35:17,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 01:35:17,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:48,940 WARN L286 SmtUtils]: Spent 16.90s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:37:06,358 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main1_~x~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_gcd_test_~b#1_32| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~b#1_32|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_16|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse0))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse1))))) (and (bvslt .cse0 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse1 .cse2))) (_ bv0 32)) (bvsgt .cse3 (_ bv0 32)) (not (bvsge .cse3 .cse2))))))))) is different from false [2024-11-09 01:37:08,377 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main1_~x~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_gcd_test_~b#1_32| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~b#1_32|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_16|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse0))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse1))))) (and (bvslt .cse0 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse1 .cse2))) (_ bv0 32)) (bvsgt .cse3 (_ bv0 32)) (not (bvsge .cse3 .cse2))))))))) is different from true [2024-11-09 01:37:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:37:08,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:37:41,309 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_17| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_17|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse0))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse1))))) (or (not (bvslt .cse0 (_ bv0 32))) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse1 .cse2))))) (not (bvsgt .cse3 (_ bv0 32))) (bvsge .cse3 .cse2)))))))) is different from false [2024-11-09 01:37:43,337 WARN L873 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_17| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_17|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse0))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse1))))) (or (not (bvslt .cse0 (_ bv0 32))) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse1 .cse2))))) (not (bvsgt .cse3 (_ bv0 32))) (bvsge .cse3 .cse2)))))))) is different from true [2024-11-09 01:37:57,896 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:37:57,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1161604701] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:37:57,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129644642] [2024-11-09 01:37:57,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 01:37:57,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:37:57,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:37:57,901 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:37:57,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a66391-6a1c-41c4-97dc-e4884e9c059e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 01:38:02,894 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 01:38:02,894 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:38:02,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 01:38:02,922 INFO L278 TraceCheckSpWp]: Computing forward predicates...