./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_6.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16f616cbb154d125e085ac05764879da22cdfe3693ed1f1a6c28186441fe892d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:16:20,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:16:20,660 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 20:16:20,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:16:20,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:16:20,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:16:20,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:16:20,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:16:20,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:16:20,696 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:16:20,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:16:20,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:16:20,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:16:20,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:16:20,696 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:16:20,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:16:20,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:16:20,697 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:16:20,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:16:20,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:16:20,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:16:20,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:16:20,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:16:20,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:16:20,698 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:16:20,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:16:20,698 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:16:20,698 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:16:20,699 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:16:20,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:16:20,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:16:20,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:16:20,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:16:20,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:16:20,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:16:20,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:16:20,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:16:20,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:16:20,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:16:20,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:16:20,701 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:16:20,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:16:20,701 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:16:20,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:16:20,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:16:20,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:16:20,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:16:20,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:16:20,702 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB 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 -> Automizer 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 -> 16f616cbb154d125e085ac05764879da22cdfe3693ed1f1a6c28186441fe892d [2024-11-27 20:16:21,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:16:21,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:16:21,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:16:21,111 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:16:21,112 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:16:21,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/combinations/gcd_2+newton_2_6.i [2024-11-27 20:16:24,605 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/data/0187cfce3/c8bedde658134de3be42aa7294d38b96/FLAGf1d0129a8 [2024-11-27 20:16:24,976 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:16:24,979 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i [2024-11-27 20:16:24,991 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/data/0187cfce3/c8bedde658134de3be42aa7294d38b96/FLAGf1d0129a8 [2024-11-27 20:16:25,189 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/data/0187cfce3/c8bedde658134de3be42aa7294d38b96 [2024-11-27 20:16:25,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:16:25,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:16:25,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:16:25,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:16:25,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:16:25,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:16:25" (1/1) ... [2024-11-27 20:16:25,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603bb13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:25, skipping insertion in model container [2024-11-27 20:16:25,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:16:25" (1/1) ... [2024-11-27 20:16:25,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:16:25,396 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_7eefc68a-5b95-4f03-8ade-dbba5f88b825/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[1226,1239] [2024-11-27 20:16:25,431 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_7eefc68a-5b95-4f03-8ade-dbba5f88b825/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[2841,2854] [2024-11-27 20:16:25,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:16:25,443 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:16:25,459 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_7eefc68a-5b95-4f03-8ade-dbba5f88b825/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[1226,1239] [2024-11-27 20:16:25,473 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_7eefc68a-5b95-4f03-8ade-dbba5f88b825/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[2841,2854] [2024-11-27 20:16:25,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:16:25,495 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:16:25,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:25 WrapperNode [2024-11-27 20:16:25,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:16:25,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:16:25,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:16:25,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:16:25,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:25" (1/1) ... [2024-11-27 20:16:25,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:25" (1/1) ... [2024-11-27 20:16:25,538 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2024-11-27 20:16:25,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:16:25,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:16:25,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:16:25,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:16:25,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:25" (1/1) ... [2024-11-27 20:16:25,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:25" (1/1) ... [2024-11-27 20:16:25,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:25" (1/1) ... [2024-11-27 20:16:25,589 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-27 20:16:25,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:25" (1/1) ... [2024-11-27 20:16:25,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:25" (1/1) ... [2024-11-27 20:16:25,600 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:25" (1/1) ... [2024-11-27 20:16:25,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:25" (1/1) ... [2024-11-27 20:16:25,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:25" (1/1) ... [2024-11-27 20:16:25,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:25" (1/1) ... [2024-11-27 20:16:25,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:25" (1/1) ... [2024-11-27 20:16:25,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:16:25,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:16:25,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:16:25,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:16:25,623 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:25" (1/1) ... [2024-11-27 20:16:25,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:16:25,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:16:25,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:16:25,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:16:25,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:16:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-27 20:16:25,710 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-27 20:16:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-27 20:16:25,710 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-27 20:16:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:16:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 20:16:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:16:25,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:16:25,795 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:16:25,798 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:16:26,066 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-27 20:16:26,067 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:16:26,078 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:16:26,079 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-27 20:16:26,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:16:26 BoogieIcfgContainer [2024-11-27 20:16:26,079 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:16:26,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:16:26,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:16:26,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:16:26,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:16:25" (1/3) ... [2024-11-27 20:16:26,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229f7006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:16:26, skipping insertion in model container [2024-11-27 20:16:26,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:25" (2/3) ... [2024-11-27 20:16:26,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229f7006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:16:26, skipping insertion in model container [2024-11-27 20:16:26,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:16:26" (3/3) ... [2024-11-27 20:16:26,096 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_6.i [2024-11-27 20:16:26,114 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:16:26,116 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_2+newton_2_6.i that has 3 procedures, 38 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2024-11-27 20:16:26,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:16:26,208 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=PETRI_NET, 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;@3024f22e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:16:26,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 20:16:26,214 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-27 20:16:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-27 20:16:26,222 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:16:26,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:16:26,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:16:26,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:16:26,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1679801867, now seen corresponding path program 1 times [2024-11-27 20:16:26,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:16:26,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924625568] [2024-11-27 20:16:26,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:16:26,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:16:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:16:26,596 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-27 20:16:26,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:16:26,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924625568] [2024-11-27 20:16:26,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924625568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:16:26,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:16:26,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:16:26,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290061077] [2024-11-27 20:16:26,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:16:26,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:16:26,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:16:26,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:16:26,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:16:26,640 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 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-27 20:16:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:16:26,755 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2024-11-27 20:16:26,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:16:26,758 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-27 20:16:26,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:16:26,765 INFO L225 Difference]: With dead ends: 75 [2024-11-27 20:16:26,765 INFO L226 Difference]: Without dead ends: 32 [2024-11-27 20:16:26,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:16:26,776 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:16:26,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 108 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:16:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-27 20:16:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-27 20:16:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 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-27 20:16:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-27 20:16:26,822 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2024-11-27 20:16:26,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:16:26,822 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-27 20:16:26,823 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-27 20:16:26,823 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-27 20:16:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-27 20:16:26,824 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:16:26,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:16:26,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:16:26,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:16:26,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:16:26,826 INFO L85 PathProgramCache]: Analyzing trace with hash 95205495, now seen corresponding path program 1 times [2024-11-27 20:16:26,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:16:26,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611625644] [2024-11-27 20:16:26,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:16:26,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:16:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:16:27,042 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-27 20:16:27,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:16:27,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611625644] [2024-11-27 20:16:27,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611625644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:16:27,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:16:27,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:16:27,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420311475] [2024-11-27 20:16:27,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:16:27,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:16:27,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:16:27,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:16:27,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:16:27,049 INFO L87 Difference]: Start difference. First operand 30 states and 33 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-27 20:16:27,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:16:27,098 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-27 20:16:27,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:16:27,099 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-27 20:16:27,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:16:27,100 INFO L225 Difference]: With dead ends: 38 [2024-11-27 20:16:27,100 INFO L226 Difference]: Without dead ends: 32 [2024-11-27 20:16:27,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:16:27,102 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:16:27,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:16:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-27 20:16:27,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-27 20:16:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 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-27 20:16:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-11-27 20:16:27,109 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2024-11-27 20:16:27,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:16:27,109 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-27 20:16:27,110 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-27 20:16:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-27 20:16:27,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 20:16:27,111 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:16:27,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:16:27,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:16:27,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:16:27,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:16:27,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1676333701, now seen corresponding path program 1 times [2024-11-27 20:16:27,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:16:27,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179428589] [2024-11-27 20:16:27,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:16:27,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:16:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:16:27,395 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-27 20:16:27,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:16:27,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179428589] [2024-11-27 20:16:27,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179428589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:16:27,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181886795] [2024-11-27 20:16:27,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:16:27,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:16:27,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:16:27,402 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:16:27,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:16:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:16:27,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-27 20:16:27,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:16:27,694 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-27 20:16:27,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:16:27,827 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-27 20:16:27,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181886795] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:16:27,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:16:27,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-27 20:16:27,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940916312] [2024-11-27 20:16:27,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:16:27,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:16:27,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:16:27,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:16:27,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:16:27,830 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-27 20:16:27,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:16:27,936 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-11-27 20:16:27,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:16:27,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-27 20:16:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:16:27,937 INFO L225 Difference]: With dead ends: 40 [2024-11-27 20:16:27,938 INFO L226 Difference]: Without dead ends: 34 [2024-11-27 20:16:27,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:16:27,939 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:16:27,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 210 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:16:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-27 20:16:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-27 20:16:27,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 26 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-27 20:16:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-27 20:16:27,945 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 13 [2024-11-27 20:16:27,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:16:27,946 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-27 20:16:27,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-27 20:16:27,946 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-27 20:16:27,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-27 20:16:27,946 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:16:27,946 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:16:27,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 20:16:28,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:16:28,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:16:28,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:16:28,148 INFO L85 PathProgramCache]: Analyzing trace with hash 976515455, now seen corresponding path program 2 times [2024-11-27 20:16:28,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:16:28,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179127905] [2024-11-27 20:16:28,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:16:28,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:16:28,199 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:16:28,200 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:16:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:16:29,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:16:29,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179127905] [2024-11-27 20:16:29,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179127905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:16:29,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666229755] [2024-11-27 20:16:29,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:16:29,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:16:29,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:16:29,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:16:29,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:16:29,203 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:16:29,203 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:16:29,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-27 20:16:29,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:16:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:16:35,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:16:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:16:50,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666229755] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:16:50,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:16:50,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2024-11-27 20:16:50,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450263211] [2024-11-27 20:16:50,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:16:50,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-27 20:16:50,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:16:50,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-27 20:16:50,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2024-11-27 20:16:50,955 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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-27 20:16:56,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-27 20:16:59,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-27 20:17:03,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-27 20:17:06,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-27 20:17:08,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-27 20:17:12,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-27 20:17:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:17:13,831 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2024-11-27 20:17:13,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 20:17:13,832 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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 15 [2024-11-27 20:17:13,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:17:13,832 INFO L225 Difference]: With dead ends: 47 [2024-11-27 20:17:13,833 INFO L226 Difference]: Without dead ends: 38 [2024-11-27 20:17:13,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-27 20:17:13,834 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:17:13,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 394 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 2 Unknown, 0 Unchecked, 19.0s Time] [2024-11-27 20:17:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-27 20:17:13,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-11-27 20:17:13,849 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-27 20:17:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-27 20:17:13,850 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 15 [2024-11-27 20:17:13,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:17:13,850 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-27 20:17:13,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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-27 20:17:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-27 20:17:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-27 20:17:13,852 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:17:13,852 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:17:13,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 20:17:14,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:14,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:17:14,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:14,054 INFO L85 PathProgramCache]: Analyzing trace with hash 44590727, now seen corresponding path program 3 times [2024-11-27 20:17:14,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:17:14,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91056930] [2024-11-27 20:17:14,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 20:17:14,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:17:14,141 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-27 20:17:14,142 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:17:18,290 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-27 20:17:18,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:17:18,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91056930] [2024-11-27 20:17:18,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91056930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:17:18,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551523861] [2024-11-27 20:17:18,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 20:17:18,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:18,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:18,292 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:18,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:17:18,547 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-27 20:17:18,547 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:17:18,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-27 20:17:18,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:24,452 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_21|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_main1_~y~0#1|) |c_ULTIMATE.start_gcd_test_~a#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_main1_~y~0#1|))) (and (not (= .cse0 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_21| 1) 0) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) (mod (+ .cse0 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256)))))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse10 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (let ((.cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse14 (mod .cse15 256))) (and (<= 128 .cse14) (= .cse14 .cse10) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse15) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_22|)))))) (.cse3 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse6 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse13 (mod .cse12 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse12) 256)) (= .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_22|) (<= .cse13 127)))))) (.cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse9 (mod .cse11 256))) (and (<= 128 .cse9) (= .cse9 .cse10) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse11) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_22|)))))) (.cse2 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse8 (mod .cse7 256))) (and (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse7) 256) 127) (= .cse8 |c_ULTIMATE.start_gcd_test_~b#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_22|) (<= .cse8 127))))))) (or (and .cse1 .cse2) (and .cse1 .cse3) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_22|))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (and .cse3 .cse4) (and .cse5 .cse3) (and .cse2 .cse6) (and .cse3 .cse6) (and .cse5 .cse2) (and .cse2 .cse4))))) is different from true [2024-11-27 20:18:24,583 WARN L286 SmtUtils]: Spent 7.33s on a formula simplification. DAG size of input: 87 DAG size of output: 78 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 20:18:32,167 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse3 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse5 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_main1_~y~0#1|))) (and (not (= .cse0 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (let ((.cse4 (+ (mod (+ .cse0 .cse5) 256) (- 256)))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse4))) (let ((.cse2 (mod .cse4 .cse1))) (and (not (= .cse1 0)) (not (= .cse2 0)) (= .cse3 (mod (+ .cse2 (* 255 .cse1)) 256)) (= (mod .cse1 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_22|)))))) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_21| 1) 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int) (|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse9 (+ (mod (+ .cse6 .cse5) 256) (- 256)))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse9))) (let ((.cse8 (mod .cse9 .cse7))) (and (not (= .cse6 0)) (not (= .cse7 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_21| 1) 0) (not (= .cse8 0)) (= .cse3 (mod (+ .cse8 (* 255 .cse7)) 256)) (= (mod .cse7 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_22|))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int) (|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse10))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse10 .cse11)) (<= 128 (+ .cse10 .cse11)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_21|) (= (mod .cse11 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_22|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int) (|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse13))) (and (not (= .cse12 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse13 .cse12)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_21|) (<= (+ .cse13 .cse12) 127) (= (mod .cse12 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_22|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse14))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse14 .cse15)) (<= 128 (+ .cse14 .cse15)) (= (mod .cse15 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_22|))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_21|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse17))) (and (not (= .cse16 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse17 .cse16)) (<= (+ .cse17 .cse16) 127) (= (mod .cse16 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_22|))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_21|))))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from true [2024-11-27 20:18:50,080 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 20:19:17,876 WARN L286 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 72 DAG size of output: 71 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 20:19:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-27 20:19:23,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:20:27,709 WARN L286 SmtUtils]: Spent 34.11s on a formula simplification. DAG size of input: 83 DAG size of output: 52 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 20:21:08,938 WARN L286 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:23:39,981 WARN L286 SmtUtils]: Spent 1.40m on a formula simplification. DAG size of input: 94 DAG size of output: 74 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 20:24:15,458 WARN L286 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:24:25,432 WARN L286 SmtUtils]: Spent 7.46s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:24:42,003 WARN L286 SmtUtils]: Spent 6.18s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:25:11,083 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:25:17,504 WARN L286 SmtUtils]: Spent 6.42s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:26:09,782 WARN L286 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:26:27,628 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:26:49,725 WARN L286 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:27:14,249 WARN L286 SmtUtils]: Spent 7.50s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:27:36,452 WARN L286 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:28:00,390 WARN L286 SmtUtils]: Spent 7.22s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:29:25,575 WARN L873 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_main1_~y~0#1| 1) (let ((.cse8 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse3 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse7 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse4 (mod (+ .cse1 .cse7) 256))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse4))) (let ((.cse6 (mod .cse5 256))) (let ((.cse2 (mod .cse4 .cse6))) (or (< (mod .cse1 256) 128) (< .cse2 .cse3) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse4) (< (mod (+ (* .cse1 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse5) 256) 128) (< 127 (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse6 (mod .cse2 256)) 0)) (= 0 .cse5) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod .cse9 256))) (let ((.cse10 (+ (mod (+ (* .cse9 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse12)) 256) (- 256)))) (let ((.cse11 (mod .cse12 .cse10))) (or (< (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse9 .cse7) 256)) (not (= (mod .cse10 (mod .cse11 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse12) (< .cse11 .cse3))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod .cse13 256))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse17))) (let ((.cse15 (mod .cse14 256))) (let ((.cse16 (mod .cse17 .cse15))) (or (< (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse13 255) .cse14) 256) 128) (not (= (mod .cse15 (mod .cse16 256)) 0)) (< 127 (mod (+ .cse13 .cse7) 256)) (< .cse16 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse17) (= .cse14 0)))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse18 256))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (let ((.cse20 (mod .cse19 256))) (let ((.cse21 (mod .cse22 .cse20))) (or (< (mod (+ (* .cse18 255) .cse19) 256) 128) (not (= (mod .cse20 (mod .cse21 256)) 0)) (< 127 (mod (+ .cse18 .cse7) 256)) (< .cse21 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse22) (< 127 (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse19 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse23 (+ (mod (+ (* .cse25 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse26)) 256) (- 256)))) (let ((.cse24 (mod .cse26 .cse23))) (or (not (= (mod .cse23 (mod .cse24 256)) 0)) (< 127 (mod (+ .cse25 .cse7) 256)) (< 127 (mod .cse25 256)) (< 127 .cse26) (< .cse24 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse28 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse30) 256))) (let ((.cse27 (mod .cse30 .cse28))) (or (< .cse27 .cse3) (= .cse28 0) (< 127 (mod (+ .cse29 .cse7) 256)) (< 127 (mod .cse29 256)) (< 127 .cse30) (not (= (mod .cse28 (mod .cse27 256)) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod .cse31 256))) (let ((.cse32 (+ (mod (+ (* .cse31 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse34)) 256) (- 256)))) (let ((.cse33 (mod .cse34 .cse32))) (or (< 127 (mod (+ .cse31 .cse7) 256)) (not (= (mod .cse32 (mod .cse33 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse34) (< 127 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse33 .cse3)))))))))) .cse8) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse36 (+ (mod (+ (* .cse35 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse38)) 256) (- 256)))) (let ((.cse37 (mod .cse38 .cse36))) (or (< (mod .cse35 256) 128) (not (= (mod .cse36 (mod .cse37 256)) 0)) (< 127 .cse38) (< (mod (+ .cse35 .cse7) 256) 128) (< .cse37 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse42) 256))) (let ((.cse39 (mod .cse42 .cse40))) (or (< .cse39 .cse3) (= .cse40 0) (< (mod .cse41 256) 128) (< 127 .cse42) (not (= (mod .cse40 (mod .cse39 256)) 0)) (< (mod (+ .cse41 .cse7) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) .cse8) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse46) 256))) (let ((.cse43 (mod .cse46 .cse44))) (or (< .cse43 .cse3) (= .cse44 0) (< (mod .cse45 256) 128) (< 127 (mod (+ .cse45 .cse7) 256)) (< 127 .cse46) (not (= (mod .cse44 (mod .cse43 256)) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse50 (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse48 (+ (mod (+ (* .cse47 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse50)) 256) (- 256)))) (let ((.cse49 (mod .cse50 .cse48))) (or (< (mod .cse47 256) 128) (not (= (mod .cse48 (mod .cse49 256)) 0)) (< 127 (mod (+ .cse47 .cse7) 256)) (< 127 .cse50) (< .cse49 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) .cse8) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse54 (mod .cse51 256))) (let ((.cse52 (+ (mod (+ (* .cse51 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse54)) 256) (- 256)))) (let ((.cse53 (mod .cse54 .cse52))) (or (< (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod .cse52 (mod .cse53 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse54) (< (mod (+ .cse51 .cse7) 256) 128) (< .cse53 .cse3))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse55 256))) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse59))) (let ((.cse57 (mod .cse56 256))) (let ((.cse58 (mod .cse59 .cse57))) (or (< (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse55 255) .cse56) 256) 128) (not (= (mod .cse57 (mod .cse58 256)) 0)) (< .cse58 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse59) (< (mod (+ .cse55 .cse7) 256) 128) (= .cse56 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))))) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse60 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse64 (mod .cse60 256))) (let ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse64))) (let ((.cse62 (mod .cse61 256))) (let ((.cse63 (mod .cse64 .cse62))) (or (< (mod (+ .cse60 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ (* .cse60 255) .cse61) 256) 128) (not (= (mod .cse62 (mod .cse63 256)) 0)) (< .cse63 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse64) (< (mod (+ .cse60 .cse7) 256) 128) (= .cse61 0))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse65 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse69 (mod .cse65 256))) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse69))) (let ((.cse67 (mod .cse66 256))) (let ((.cse68 (mod .cse69 .cse67))) (or (< (mod (+ (* .cse65 255) .cse66) 256) 128) (not (= (mod .cse67 (mod .cse68 256)) 0)) (< 127 (mod (+ .cse65 .cse7) 256)) (< .cse68 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse69) (< 127 (mod (+ .cse65 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse66 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse72 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse72 .cse7) 256))) (let ((.cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse71))) (let ((.cse74 (mod .cse73 256))) (let ((.cse70 (mod .cse71 .cse74))) (or (< .cse70 .cse3) (< 127 .cse71) (< 127 (mod .cse72 256)) (< (mod (+ (* .cse72 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse73) 256) 128) (< 127 (mod (+ .cse72 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse74 (mod .cse70 256)) 0)) (= 0 .cse73) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))))) .cse0) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse79 (mod .cse75 256))) (let ((.cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse79))) (let ((.cse77 (mod .cse76 256))) (let ((.cse78 (mod .cse79 .cse77))) (or (< (mod (+ (* .cse75 255) .cse76) 256) 128) (not (= (mod .cse77 (mod .cse78 256)) 0)) (< .cse78 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse79) (< 127 (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse75 .cse7) 256) 128) (= .cse76 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse82 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse83 (mod (+ .cse82 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse80 (+ (mod (+ (* .cse82 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse83)) 256) (- 256)))) (let ((.cse81 (mod .cse83 .cse80))) (or (not (= (mod .cse80 (mod .cse81 256)) 0)) (< 127 (mod .cse82 256)) (< 127 .cse83) (< (mod (+ .cse82 .cse7) 256) 128) (< .cse81 .cse3) (= .cse82 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse86 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse86 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse85 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse87) 256))) (let ((.cse84 (mod .cse87 .cse85))) (or (< .cse84 .cse3) (= .cse85 0) (< 127 (mod .cse86 256)) (< 127 .cse87) (not (= (mod .cse85 (mod .cse84 256)) 0)) (< (mod (+ .cse86 .cse7) 256) 128) (= .cse86 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse91 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse90 (mod .cse91 256))) (let ((.cse88 (+ (mod (+ (* .cse91 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse90)) 256) (- 256)))) (let ((.cse89 (mod .cse90 .cse88))) (or (not (= (mod .cse88 (mod .cse89 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse90) (< 127 (mod (+ .cse91 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse91 .cse7) 256) 128) (< .cse89 .cse3)))))))))) .cse8) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse92 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse96 (mod .cse92 256))) (let ((.cse93 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse96))) (let ((.cse94 (mod .cse93 256))) (let ((.cse95 (mod .cse96 .cse94))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ (* .cse92 255) .cse93) 256) 128) (not (= (mod .cse94 (mod .cse95 256)) 0)) (< .cse95 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse96) (< 127 (mod (+ .cse92 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse92 .cse7) 256) 128) (= .cse93 0))))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse97 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse101 (mod .cse97 256))) (let ((.cse98 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse101))) (let ((.cse99 (mod .cse98 256))) (let ((.cse100 (mod .cse101 .cse99))) (or (< (mod (+ .cse97 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse97 255) .cse98) 256) 128) (not (= (mod .cse99 (mod .cse100 256)) 0)) (< 127 (mod (+ .cse97 .cse7) 256)) (< .cse100 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse101) (= .cse98 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse103 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse104 (mod (+ .cse103 .cse7) 256))) (let ((.cse105 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse104))) (let ((.cse106 (mod .cse105 256))) (let ((.cse102 (mod .cse104 .cse106))) (or (< .cse102 .cse3) (< (mod (+ .cse103 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse104) (< 127 (mod .cse103 256)) (< (mod (+ (* .cse103 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse105) 256) 128) (not (= (mod .cse106 (mod .cse102 256)) 0)) (= 0 .cse105) (= .cse103 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse107 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse109 (mod (+ .cse107 .cse7) 256))) (let ((.cse110 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse109))) (let ((.cse111 (mod .cse110 256))) (let ((.cse108 (mod .cse109 .cse111))) (or (< (mod .cse107 256) 128) (< .cse108 .cse3) (< (mod (+ .cse107 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse109) (< (mod (+ (* .cse107 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse110) 256) 128) (not (= (mod .cse111 (mod .cse108 256)) 0)) (= 0 .cse110) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))))) is different from true [2024-11-27 20:30:05,505 WARN L873 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_main1_~y~0#1| 1) (let ((.cse8 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse3 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse7 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse4 (mod (+ .cse1 .cse7) 256))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse4))) (let ((.cse6 (mod .cse5 256))) (let ((.cse2 (mod .cse4 .cse6))) (or (< (mod .cse1 256) 128) (< .cse2 .cse3) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse4) (< (mod (+ (* .cse1 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse5) 256) 128) (< 127 (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse6 (mod .cse2 256)) 0)) (= 0 .cse5) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod .cse9 256))) (let ((.cse10 (+ (mod (+ (* .cse9 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse12)) 256) (- 256)))) (let ((.cse11 (mod .cse12 .cse10))) (or (< (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse9 .cse7) 256)) (not (= (mod .cse10 (mod .cse11 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse12) (< .cse11 .cse3))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod .cse13 256))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse17))) (let ((.cse15 (mod .cse14 256))) (let ((.cse16 (mod .cse17 .cse15))) (or (< (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse13 255) .cse14) 256) 128) (not (= (mod .cse15 (mod .cse16 256)) 0)) (< 127 (mod (+ .cse13 .cse7) 256)) (< .cse16 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse17) (= .cse14 0)))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse18 256))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (let ((.cse20 (mod .cse19 256))) (let ((.cse21 (mod .cse22 .cse20))) (or (< (mod (+ (* .cse18 255) .cse19) 256) 128) (not (= (mod .cse20 (mod .cse21 256)) 0)) (< 127 (mod (+ .cse18 .cse7) 256)) (< .cse21 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse22) (< 127 (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse19 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse23 (+ (mod (+ (* .cse25 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse26)) 256) (- 256)))) (let ((.cse24 (mod .cse26 .cse23))) (or (not (= (mod .cse23 (mod .cse24 256)) 0)) (< 127 (mod (+ .cse25 .cse7) 256)) (< 127 (mod .cse25 256)) (< 127 .cse26) (< .cse24 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse28 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse30) 256))) (let ((.cse27 (mod .cse30 .cse28))) (or (< .cse27 .cse3) (= .cse28 0) (< 127 (mod (+ .cse29 .cse7) 256)) (< 127 (mod .cse29 256)) (< 127 .cse30) (not (= (mod .cse28 (mod .cse27 256)) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod .cse31 256))) (let ((.cse32 (+ (mod (+ (* .cse31 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse34)) 256) (- 256)))) (let ((.cse33 (mod .cse34 .cse32))) (or (< 127 (mod (+ .cse31 .cse7) 256)) (not (= (mod .cse32 (mod .cse33 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse34) (< 127 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse33 .cse3)))))))))) .cse8) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse36 (+ (mod (+ (* .cse35 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse38)) 256) (- 256)))) (let ((.cse37 (mod .cse38 .cse36))) (or (< (mod .cse35 256) 128) (not (= (mod .cse36 (mod .cse37 256)) 0)) (< 127 .cse38) (< (mod (+ .cse35 .cse7) 256) 128) (< .cse37 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse42) 256))) (let ((.cse39 (mod .cse42 .cse40))) (or (< .cse39 .cse3) (= .cse40 0) (< (mod .cse41 256) 128) (< 127 .cse42) (not (= (mod .cse40 (mod .cse39 256)) 0)) (< (mod (+ .cse41 .cse7) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) .cse8) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse46) 256))) (let ((.cse43 (mod .cse46 .cse44))) (or (< .cse43 .cse3) (= .cse44 0) (< (mod .cse45 256) 128) (< 127 (mod (+ .cse45 .cse7) 256)) (< 127 .cse46) (not (= (mod .cse44 (mod .cse43 256)) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse50 (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse48 (+ (mod (+ (* .cse47 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse50)) 256) (- 256)))) (let ((.cse49 (mod .cse50 .cse48))) (or (< (mod .cse47 256) 128) (not (= (mod .cse48 (mod .cse49 256)) 0)) (< 127 (mod (+ .cse47 .cse7) 256)) (< 127 .cse50) (< .cse49 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) .cse8) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse54 (mod .cse51 256))) (let ((.cse52 (+ (mod (+ (* .cse51 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse54)) 256) (- 256)))) (let ((.cse53 (mod .cse54 .cse52))) (or (< (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod .cse52 (mod .cse53 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse54) (< (mod (+ .cse51 .cse7) 256) 128) (< .cse53 .cse3))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse55 256))) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse59))) (let ((.cse57 (mod .cse56 256))) (let ((.cse58 (mod .cse59 .cse57))) (or (< (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse55 255) .cse56) 256) 128) (not (= (mod .cse57 (mod .cse58 256)) 0)) (< .cse58 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse59) (< (mod (+ .cse55 .cse7) 256) 128) (= .cse56 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))))) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse60 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse64 (mod .cse60 256))) (let ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse64))) (let ((.cse62 (mod .cse61 256))) (let ((.cse63 (mod .cse64 .cse62))) (or (< (mod (+ .cse60 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ (* .cse60 255) .cse61) 256) 128) (not (= (mod .cse62 (mod .cse63 256)) 0)) (< .cse63 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse64) (< (mod (+ .cse60 .cse7) 256) 128) (= .cse61 0))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse65 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse69 (mod .cse65 256))) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse69))) (let ((.cse67 (mod .cse66 256))) (let ((.cse68 (mod .cse69 .cse67))) (or (< (mod (+ (* .cse65 255) .cse66) 256) 128) (not (= (mod .cse67 (mod .cse68 256)) 0)) (< 127 (mod (+ .cse65 .cse7) 256)) (< .cse68 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse69) (< 127 (mod (+ .cse65 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse66 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse72 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse72 .cse7) 256))) (let ((.cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse71))) (let ((.cse74 (mod .cse73 256))) (let ((.cse70 (mod .cse71 .cse74))) (or (< .cse70 .cse3) (< 127 .cse71) (< 127 (mod .cse72 256)) (< (mod (+ (* .cse72 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse73) 256) 128) (< 127 (mod (+ .cse72 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse74 (mod .cse70 256)) 0)) (= 0 .cse73) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))))) .cse0) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse79 (mod .cse75 256))) (let ((.cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse79))) (let ((.cse77 (mod .cse76 256))) (let ((.cse78 (mod .cse79 .cse77))) (or (< (mod (+ (* .cse75 255) .cse76) 256) 128) (not (= (mod .cse77 (mod .cse78 256)) 0)) (< .cse78 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse79) (< 127 (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse75 .cse7) 256) 128) (= .cse76 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse82 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse83 (mod (+ .cse82 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse80 (+ (mod (+ (* .cse82 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse83)) 256) (- 256)))) (let ((.cse81 (mod .cse83 .cse80))) (or (not (= (mod .cse80 (mod .cse81 256)) 0)) (< 127 (mod .cse82 256)) (< 127 .cse83) (< (mod (+ .cse82 .cse7) 256) 128) (< .cse81 .cse3) (= .cse82 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse86 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse86 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse85 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse87) 256))) (let ((.cse84 (mod .cse87 .cse85))) (or (< .cse84 .cse3) (= .cse85 0) (< 127 (mod .cse86 256)) (< 127 .cse87) (not (= (mod .cse85 (mod .cse84 256)) 0)) (< (mod (+ .cse86 .cse7) 256) 128) (= .cse86 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse91 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse90 (mod .cse91 256))) (let ((.cse88 (+ (mod (+ (* .cse91 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse90)) 256) (- 256)))) (let ((.cse89 (mod .cse90 .cse88))) (or (not (= (mod .cse88 (mod .cse89 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse90) (< 127 (mod (+ .cse91 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse91 .cse7) 256) 128) (< .cse89 .cse3)))))))))) .cse8) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse92 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse96 (mod .cse92 256))) (let ((.cse93 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse96))) (let ((.cse94 (mod .cse93 256))) (let ((.cse95 (mod .cse96 .cse94))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ (* .cse92 255) .cse93) 256) 128) (not (= (mod .cse94 (mod .cse95 256)) 0)) (< .cse95 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse96) (< 127 (mod (+ .cse92 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse92 .cse7) 256) 128) (= .cse93 0))))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse97 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse101 (mod .cse97 256))) (let ((.cse98 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse101))) (let ((.cse99 (mod .cse98 256))) (let ((.cse100 (mod .cse101 .cse99))) (or (< (mod (+ .cse97 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse97 255) .cse98) 256) 128) (not (= (mod .cse99 (mod .cse100 256)) 0)) (< 127 (mod (+ .cse97 .cse7) 256)) (< .cse100 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse101) (= .cse98 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse103 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse104 (mod (+ .cse103 .cse7) 256))) (let ((.cse105 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse104))) (let ((.cse106 (mod .cse105 256))) (let ((.cse102 (mod .cse104 .cse106))) (or (< .cse102 .cse3) (< (mod (+ .cse103 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse104) (< 127 (mod .cse103 256)) (< (mod (+ (* .cse103 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse105) 256) 128) (not (= (mod .cse106 (mod .cse102 256)) 0)) (= 0 .cse105) (= .cse103 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse107 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse109 (mod (+ .cse107 .cse7) 256))) (let ((.cse110 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse109))) (let ((.cse111 (mod .cse110 256))) (let ((.cse108 (mod .cse109 .cse111))) (or (< (mod .cse107 256) 128) (< .cse108 .cse3) (< (mod (+ .cse107 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse109) (< (mod (+ (* .cse107 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse110) 256) 128) (not (= (mod .cse111 (mod .cse108 256)) 0)) (= 0 .cse110) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2024-11-27 20:30:29,863 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse5 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse4 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse0 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod .cse0 256))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse6))) (let ((.cse2 (mod .cse1 256))) (let ((.cse3 (mod .cse6 .cse2))) (or (< (mod (+ .cse0 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse0 255) .cse1) 256) 128) (not (= (mod .cse2 (mod .cse3 256)) 0)) (< 127 (mod (+ .cse0 .cse4) 256)) (< .cse3 .cse5) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse6) (= .cse1 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse7 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (mod .cse7 256))) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse11))) (let ((.cse9 (mod .cse8 256))) (let ((.cse10 (mod .cse11 .cse9))) (or (< (mod (+ (* .cse7 255) .cse8) 256) 128) (not (= (mod .cse9 (mod .cse10 256)) 0)) (< 127 (mod (+ .cse7 .cse4) 256)) (< .cse10 .cse5) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse11) (< 127 (mod (+ .cse7 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse8 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse12 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod (+ .cse12 .cse4) 256))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse14))) (let ((.cse16 (mod .cse15 256))) (let ((.cse13 (mod .cse14 .cse16))) (or (< (mod .cse12 256) 128) (< .cse13 .cse5) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse14) (< (mod (+ (* .cse12 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse15) 256) 128) (< 127 (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse16 (mod .cse13 256)) 0)) (= 0 .cse15) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod (+ .cse19 .cse4) 256))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse18))) (let ((.cse21 (mod .cse20 256))) (let ((.cse17 (mod .cse18 .cse21))) (or (< .cse17 .cse5) (< 127 .cse18) (< 127 (mod .cse19 256)) (< (mod (+ (* .cse19 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse20) 256) 128) (< 127 (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse21 (mod .cse17 256)) 0)) (= 0 .cse20) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse22 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ .cse22 .cse4) 256))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse24))) (let ((.cse26 (mod .cse25 256))) (let ((.cse23 (mod .cse24 .cse26))) (or (< (mod .cse22 256) 128) (< .cse23 .cse5) (< (mod (+ .cse22 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse24) (< (mod (+ (* .cse22 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse25) 256) 128) (not (= (mod .cse26 (mod .cse23 256)) 0)) (= 0 .cse25) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod (+ .cse28 .cse4) 256))) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse29))) (let ((.cse31 (mod .cse30 256))) (let ((.cse27 (mod .cse29 .cse31))) (or (< .cse27 .cse5) (< (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse29) (< 127 (mod .cse28 256)) (< (mod (+ (* .cse28 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 128) (not (= (mod .cse31 (mod .cse27 256)) 0)) (= 0 .cse30) (= .cse28 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse32 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse36 (mod .cse32 256))) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse36))) (let ((.cse34 (mod .cse33 256))) (let ((.cse35 (mod .cse36 .cse34))) (or (< (mod (+ .cse32 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ (* .cse32 255) .cse33) 256) 128) (not (= (mod .cse34 (mod .cse35 256)) 0)) (< .cse35 .cse5) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse36) (< (mod (+ .cse32 .cse4) 256) 128) (= .cse33 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse37 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod .cse37 256))) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse41))) (let ((.cse39 (mod .cse38 256))) (let ((.cse40 (mod .cse41 .cse39))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ (* .cse37 255) .cse38) 256) 128) (not (= (mod .cse39 (mod .cse40 256)) 0)) (< .cse40 .cse5) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse41) (< 127 (mod (+ .cse37 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse37 .cse4) 256) 128) (= .cse38 0)))))))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (< |c_ULTIMATE.start_main1_~y~0#1| 1) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2024-11-27 20:30:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-27 20:30:51,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551523861] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:30:51,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:30:51,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 39 [2024-11-27 20:30:51,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4359104] [2024-11-27 20:30:51,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:30:51,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-27 20:30:51,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:30:51,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-27 20:30:51,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=933, Unknown=16, NotChecked=340, Total=1482 [2024-11-27 20:30:51,041 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 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-27 20:31:02,017 WARN L873 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (< |c_ULTIMATE.start_main1_~y~0#1| 1) (let ((.cse8 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse3 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse7 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse4 (mod (+ .cse1 .cse7) 256))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse4))) (let ((.cse6 (mod .cse5 256))) (let ((.cse2 (mod .cse4 .cse6))) (or (< (mod .cse1 256) 128) (< .cse2 .cse3) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse4) (< (mod (+ (* .cse1 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse5) 256) 128) (< 127 (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse6 (mod .cse2 256)) 0)) (= 0 .cse5) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod .cse9 256))) (let ((.cse10 (+ (mod (+ (* .cse9 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse12)) 256) (- 256)))) (let ((.cse11 (mod .cse12 .cse10))) (or (< (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse9 .cse7) 256)) (not (= (mod .cse10 (mod .cse11 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse12) (< .cse11 .cse3))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod .cse13 256))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse17))) (let ((.cse15 (mod .cse14 256))) (let ((.cse16 (mod .cse17 .cse15))) (or (< (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse13 255) .cse14) 256) 128) (not (= (mod .cse15 (mod .cse16 256)) 0)) (< 127 (mod (+ .cse13 .cse7) 256)) (< .cse16 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse17) (= .cse14 0)))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse18 256))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (let ((.cse20 (mod .cse19 256))) (let ((.cse21 (mod .cse22 .cse20))) (or (< (mod (+ (* .cse18 255) .cse19) 256) 128) (not (= (mod .cse20 (mod .cse21 256)) 0)) (< 127 (mod (+ .cse18 .cse7) 256)) (< .cse21 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse22) (< 127 (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse19 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse23 (+ (mod (+ (* .cse25 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse26)) 256) (- 256)))) (let ((.cse24 (mod .cse26 .cse23))) (or (not (= (mod .cse23 (mod .cse24 256)) 0)) (< 127 (mod (+ .cse25 .cse7) 256)) (< 127 (mod .cse25 256)) (< 127 .cse26) (< .cse24 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse28 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse30) 256))) (let ((.cse27 (mod .cse30 .cse28))) (or (< .cse27 .cse3) (= .cse28 0) (< 127 (mod (+ .cse29 .cse7) 256)) (< 127 (mod .cse29 256)) (< 127 .cse30) (not (= (mod .cse28 (mod .cse27 256)) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod .cse31 256))) (let ((.cse32 (+ (mod (+ (* .cse31 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse34)) 256) (- 256)))) (let ((.cse33 (mod .cse34 .cse32))) (or (< 127 (mod (+ .cse31 .cse7) 256)) (not (= (mod .cse32 (mod .cse33 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse34) (< 127 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse33 .cse3)))))))))) .cse8) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse36 (+ (mod (+ (* .cse35 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse38)) 256) (- 256)))) (let ((.cse37 (mod .cse38 .cse36))) (or (< (mod .cse35 256) 128) (not (= (mod .cse36 (mod .cse37 256)) 0)) (< 127 .cse38) (< (mod (+ .cse35 .cse7) 256) 128) (< .cse37 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse42) 256))) (let ((.cse39 (mod .cse42 .cse40))) (or (< .cse39 .cse3) (= .cse40 0) (< (mod .cse41 256) 128) (< 127 .cse42) (not (= (mod .cse40 (mod .cse39 256)) 0)) (< (mod (+ .cse41 .cse7) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) .cse8) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse46) 256))) (let ((.cse43 (mod .cse46 .cse44))) (or (< .cse43 .cse3) (= .cse44 0) (< (mod .cse45 256) 128) (< 127 (mod (+ .cse45 .cse7) 256)) (< 127 .cse46) (not (= (mod .cse44 (mod .cse43 256)) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse50 (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse48 (+ (mod (+ (* .cse47 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse50)) 256) (- 256)))) (let ((.cse49 (mod .cse50 .cse48))) (or (< (mod .cse47 256) 128) (not (= (mod .cse48 (mod .cse49 256)) 0)) (< 127 (mod (+ .cse47 .cse7) 256)) (< 127 .cse50) (< .cse49 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) .cse8) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse54 (mod .cse51 256))) (let ((.cse52 (+ (mod (+ (* .cse51 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse54)) 256) (- 256)))) (let ((.cse53 (mod .cse54 .cse52))) (or (< (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod .cse52 (mod .cse53 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse54) (< (mod (+ .cse51 .cse7) 256) 128) (< .cse53 .cse3))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse55 256))) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse59))) (let ((.cse57 (mod .cse56 256))) (let ((.cse58 (mod .cse59 .cse57))) (or (< (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse55 255) .cse56) 256) 128) (not (= (mod .cse57 (mod .cse58 256)) 0)) (< .cse58 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse59) (< (mod (+ .cse55 .cse7) 256) 128) (= .cse56 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))))) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse60 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse64 (mod .cse60 256))) (let ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse64))) (let ((.cse62 (mod .cse61 256))) (let ((.cse63 (mod .cse64 .cse62))) (or (< (mod (+ .cse60 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ (* .cse60 255) .cse61) 256) 128) (not (= (mod .cse62 (mod .cse63 256)) 0)) (< .cse63 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse64) (< (mod (+ .cse60 .cse7) 256) 128) (= .cse61 0))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse65 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse69 (mod .cse65 256))) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse69))) (let ((.cse67 (mod .cse66 256))) (let ((.cse68 (mod .cse69 .cse67))) (or (< (mod (+ (* .cse65 255) .cse66) 256) 128) (not (= (mod .cse67 (mod .cse68 256)) 0)) (< 127 (mod (+ .cse65 .cse7) 256)) (< .cse68 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse69) (< 127 (mod (+ .cse65 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse66 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse72 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse72 .cse7) 256))) (let ((.cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse71))) (let ((.cse74 (mod .cse73 256))) (let ((.cse70 (mod .cse71 .cse74))) (or (< .cse70 .cse3) (< 127 .cse71) (< 127 (mod .cse72 256)) (< (mod (+ (* .cse72 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse73) 256) 128) (< 127 (mod (+ .cse72 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse74 (mod .cse70 256)) 0)) (= 0 .cse73) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))))) .cse0) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse79 (mod .cse75 256))) (let ((.cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse79))) (let ((.cse77 (mod .cse76 256))) (let ((.cse78 (mod .cse79 .cse77))) (or (< (mod (+ (* .cse75 255) .cse76) 256) 128) (not (= (mod .cse77 (mod .cse78 256)) 0)) (< .cse78 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse79) (< 127 (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse75 .cse7) 256) 128) (= .cse76 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse82 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse83 (mod (+ .cse82 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse80 (+ (mod (+ (* .cse82 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse83)) 256) (- 256)))) (let ((.cse81 (mod .cse83 .cse80))) (or (not (= (mod .cse80 (mod .cse81 256)) 0)) (< 127 (mod .cse82 256)) (< 127 .cse83) (< (mod (+ .cse82 .cse7) 256) 128) (< .cse81 .cse3) (= .cse82 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse86 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse86 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse85 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse87) 256))) (let ((.cse84 (mod .cse87 .cse85))) (or (< .cse84 .cse3) (= .cse85 0) (< 127 (mod .cse86 256)) (< 127 .cse87) (not (= (mod .cse85 (mod .cse84 256)) 0)) (< (mod (+ .cse86 .cse7) 256) 128) (= .cse86 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse91 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse90 (mod .cse91 256))) (let ((.cse88 (+ (mod (+ (* .cse91 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse90)) 256) (- 256)))) (let ((.cse89 (mod .cse90 .cse88))) (or (not (= (mod .cse88 (mod .cse89 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse90) (< 127 (mod (+ .cse91 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse91 .cse7) 256) 128) (< .cse89 .cse3)))))))))) .cse8) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse92 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse96 (mod .cse92 256))) (let ((.cse93 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse96))) (let ((.cse94 (mod .cse93 256))) (let ((.cse95 (mod .cse96 .cse94))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ (* .cse92 255) .cse93) 256) 128) (not (= (mod .cse94 (mod .cse95 256)) 0)) (< .cse95 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse96) (< 127 (mod (+ .cse92 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse92 .cse7) 256) 128) (= .cse93 0))))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse97 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse101 (mod .cse97 256))) (let ((.cse98 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse101))) (let ((.cse99 (mod .cse98 256))) (let ((.cse100 (mod .cse101 .cse99))) (or (< (mod (+ .cse97 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse97 255) .cse98) 256) 128) (not (= (mod .cse99 (mod .cse100 256)) 0)) (< 127 (mod (+ .cse97 .cse7) 256)) (< .cse100 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse101) (= .cse98 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse103 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse104 (mod (+ .cse103 .cse7) 256))) (let ((.cse105 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse104))) (let ((.cse106 (mod .cse105 256))) (let ((.cse102 (mod .cse104 .cse106))) (or (< .cse102 .cse3) (< (mod (+ .cse103 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse104) (< 127 (mod .cse103 256)) (< (mod (+ (* .cse103 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse105) 256) 128) (not (= (mod .cse106 (mod .cse102 256)) 0)) (= 0 .cse105) (= .cse103 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse107 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse109 (mod (+ .cse107 .cse7) 256))) (let ((.cse110 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse109))) (let ((.cse111 (mod .cse110 256))) (let ((.cse108 (mod .cse109 .cse111))) (or (< (mod .cse107 256) 128) (< .cse108 .cse3) (< (mod (+ .cse107 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse109) (< (mod (+ (* .cse107 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse110) 256) 128) (not (= (mod .cse111 (mod .cse108 256)) 0)) (= 0 .cse110) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|)) is different from true [2024-11-27 20:31:06,078 WARN L873 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (or (< |c_ULTIMATE.start_main1_~y~0#1| 1) (let ((.cse8 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse3 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse7 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse4 (mod (+ .cse1 .cse7) 256))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse4))) (let ((.cse6 (mod .cse5 256))) (let ((.cse2 (mod .cse4 .cse6))) (or (< (mod .cse1 256) 128) (< .cse2 .cse3) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse4) (< (mod (+ (* .cse1 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse5) 256) 128) (< 127 (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse6 (mod .cse2 256)) 0)) (= 0 .cse5) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod .cse9 256))) (let ((.cse10 (+ (mod (+ (* .cse9 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse12)) 256) (- 256)))) (let ((.cse11 (mod .cse12 .cse10))) (or (< (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse9 .cse7) 256)) (not (= (mod .cse10 (mod .cse11 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse12) (< .cse11 .cse3))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod .cse13 256))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse17))) (let ((.cse15 (mod .cse14 256))) (let ((.cse16 (mod .cse17 .cse15))) (or (< (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse13 255) .cse14) 256) 128) (not (= (mod .cse15 (mod .cse16 256)) 0)) (< 127 (mod (+ .cse13 .cse7) 256)) (< .cse16 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse17) (= .cse14 0)))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse18 256))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (let ((.cse20 (mod .cse19 256))) (let ((.cse21 (mod .cse22 .cse20))) (or (< (mod (+ (* .cse18 255) .cse19) 256) 128) (not (= (mod .cse20 (mod .cse21 256)) 0)) (< 127 (mod (+ .cse18 .cse7) 256)) (< .cse21 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse22) (< 127 (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse19 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse23 (+ (mod (+ (* .cse25 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse26)) 256) (- 256)))) (let ((.cse24 (mod .cse26 .cse23))) (or (not (= (mod .cse23 (mod .cse24 256)) 0)) (< 127 (mod (+ .cse25 .cse7) 256)) (< 127 (mod .cse25 256)) (< 127 .cse26) (< .cse24 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse28 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse30) 256))) (let ((.cse27 (mod .cse30 .cse28))) (or (< .cse27 .cse3) (= .cse28 0) (< 127 (mod (+ .cse29 .cse7) 256)) (< 127 (mod .cse29 256)) (< 127 .cse30) (not (= (mod .cse28 (mod .cse27 256)) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod .cse31 256))) (let ((.cse32 (+ (mod (+ (* .cse31 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse34)) 256) (- 256)))) (let ((.cse33 (mod .cse34 .cse32))) (or (< 127 (mod (+ .cse31 .cse7) 256)) (not (= (mod .cse32 (mod .cse33 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse34) (< 127 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse33 .cse3)))))))))) .cse8) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse36 (+ (mod (+ (* .cse35 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse38)) 256) (- 256)))) (let ((.cse37 (mod .cse38 .cse36))) (or (< (mod .cse35 256) 128) (not (= (mod .cse36 (mod .cse37 256)) 0)) (< 127 .cse38) (< (mod (+ .cse35 .cse7) 256) 128) (< .cse37 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse42) 256))) (let ((.cse39 (mod .cse42 .cse40))) (or (< .cse39 .cse3) (= .cse40 0) (< (mod .cse41 256) 128) (< 127 .cse42) (not (= (mod .cse40 (mod .cse39 256)) 0)) (< (mod (+ .cse41 .cse7) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) .cse8) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse46) 256))) (let ((.cse43 (mod .cse46 .cse44))) (or (< .cse43 .cse3) (= .cse44 0) (< (mod .cse45 256) 128) (< 127 (mod (+ .cse45 .cse7) 256)) (< 127 .cse46) (not (= (mod .cse44 (mod .cse43 256)) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse50 (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse48 (+ (mod (+ (* .cse47 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse50)) 256) (- 256)))) (let ((.cse49 (mod .cse50 .cse48))) (or (< (mod .cse47 256) 128) (not (= (mod .cse48 (mod .cse49 256)) 0)) (< 127 (mod (+ .cse47 .cse7) 256)) (< 127 .cse50) (< .cse49 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) .cse8) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse54 (mod .cse51 256))) (let ((.cse52 (+ (mod (+ (* .cse51 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse54)) 256) (- 256)))) (let ((.cse53 (mod .cse54 .cse52))) (or (< (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod .cse52 (mod .cse53 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse54) (< (mod (+ .cse51 .cse7) 256) 128) (< .cse53 .cse3))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse55 256))) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse59))) (let ((.cse57 (mod .cse56 256))) (let ((.cse58 (mod .cse59 .cse57))) (or (< (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse55 255) .cse56) 256) 128) (not (= (mod .cse57 (mod .cse58 256)) 0)) (< .cse58 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse59) (< (mod (+ .cse55 .cse7) 256) 128) (= .cse56 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))))) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse60 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse64 (mod .cse60 256))) (let ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse64))) (let ((.cse62 (mod .cse61 256))) (let ((.cse63 (mod .cse64 .cse62))) (or (< (mod (+ .cse60 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ (* .cse60 255) .cse61) 256) 128) (not (= (mod .cse62 (mod .cse63 256)) 0)) (< .cse63 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse64) (< (mod (+ .cse60 .cse7) 256) 128) (= .cse61 0))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse65 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse69 (mod .cse65 256))) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse69))) (let ((.cse67 (mod .cse66 256))) (let ((.cse68 (mod .cse69 .cse67))) (or (< (mod (+ (* .cse65 255) .cse66) 256) 128) (not (= (mod .cse67 (mod .cse68 256)) 0)) (< 127 (mod (+ .cse65 .cse7) 256)) (< .cse68 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse69) (< 127 (mod (+ .cse65 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse66 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse72 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse72 .cse7) 256))) (let ((.cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse71))) (let ((.cse74 (mod .cse73 256))) (let ((.cse70 (mod .cse71 .cse74))) (or (< .cse70 .cse3) (< 127 .cse71) (< 127 (mod .cse72 256)) (< (mod (+ (* .cse72 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse73) 256) 128) (< 127 (mod (+ .cse72 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse74 (mod .cse70 256)) 0)) (= 0 .cse73) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))))) .cse0) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse79 (mod .cse75 256))) (let ((.cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse79))) (let ((.cse77 (mod .cse76 256))) (let ((.cse78 (mod .cse79 .cse77))) (or (< (mod (+ (* .cse75 255) .cse76) 256) 128) (not (= (mod .cse77 (mod .cse78 256)) 0)) (< .cse78 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse79) (< 127 (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse75 .cse7) 256) 128) (= .cse76 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse82 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse83 (mod (+ .cse82 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse80 (+ (mod (+ (* .cse82 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse83)) 256) (- 256)))) (let ((.cse81 (mod .cse83 .cse80))) (or (not (= (mod .cse80 (mod .cse81 256)) 0)) (< 127 (mod .cse82 256)) (< 127 .cse83) (< (mod (+ .cse82 .cse7) 256) 128) (< .cse81 .cse3) (= .cse82 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse86 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse86 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse85 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse87) 256))) (let ((.cse84 (mod .cse87 .cse85))) (or (< .cse84 .cse3) (= .cse85 0) (< 127 (mod .cse86 256)) (< 127 .cse87) (not (= (mod .cse85 (mod .cse84 256)) 0)) (< (mod (+ .cse86 .cse7) 256) 128) (= .cse86 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse91 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse90 (mod .cse91 256))) (let ((.cse88 (+ (mod (+ (* .cse91 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse90)) 256) (- 256)))) (let ((.cse89 (mod .cse90 .cse88))) (or (not (= (mod .cse88 (mod .cse89 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse90) (< 127 (mod (+ .cse91 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse91 .cse7) 256) 128) (< .cse89 .cse3)))))))))) .cse8) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse92 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse96 (mod .cse92 256))) (let ((.cse93 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse96))) (let ((.cse94 (mod .cse93 256))) (let ((.cse95 (mod .cse96 .cse94))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ (* .cse92 255) .cse93) 256) 128) (not (= (mod .cse94 (mod .cse95 256)) 0)) (< .cse95 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse96) (< 127 (mod (+ .cse92 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse92 .cse7) 256) 128) (= .cse93 0))))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse97 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse101 (mod .cse97 256))) (let ((.cse98 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse101))) (let ((.cse99 (mod .cse98 256))) (let ((.cse100 (mod .cse101 .cse99))) (or (< (mod (+ .cse97 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse97 255) .cse98) 256) 128) (not (= (mod .cse99 (mod .cse100 256)) 0)) (< 127 (mod (+ .cse97 .cse7) 256)) (< .cse100 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse101) (= .cse98 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse103 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse104 (mod (+ .cse103 .cse7) 256))) (let ((.cse105 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse104))) (let ((.cse106 (mod .cse105 256))) (let ((.cse102 (mod .cse104 .cse106))) (or (< .cse102 .cse3) (< (mod (+ .cse103 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse104) (< 127 (mod .cse103 256)) (< (mod (+ (* .cse103 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse105) 256) 128) (not (= (mod .cse106 (mod .cse102 256)) 0)) (= 0 .cse105) (= .cse103 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse107 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse109 (mod (+ .cse107 .cse7) 256))) (let ((.cse110 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse109))) (let ((.cse111 (mod .cse110 256))) (let ((.cse108 (mod .cse109 .cse111))) (or (< (mod .cse107 256) 128) (< .cse108 .cse3) (< (mod (+ .cse107 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse109) (< (mod (+ (* .cse107 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse110) 256) 128) (not (= (mod .cse111 (mod .cse108 256)) 0)) (= 0 .cse110) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|)) is different from true [2024-11-27 20:31:10,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-27 20:31:15,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-27 20:31:28,779 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-27 20:31:28,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-27 20:31:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:31:28,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 297.7s TimeCoverageRelationStatistics Valid=207, Invalid=993, Unknown=18, NotChecked=504, Total=1722 [2024-11-27 20:31:28,781 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:31:28,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 2 Unknown, 130 Unchecked, 9.2s Time] [2024-11-27 20:31:28,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 20:31:28,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:31:28,988 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:947) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 47 more [2024-11-27 20:31:28,995 INFO L158 Benchmark]: Toolchain (without parser) took 903801.99ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 93.8MB in the beginning and 258.0MB in the end (delta: -164.3MB). Peak memory consumption was 141.0MB. Max. memory is 16.1GB. [2024-11-27 20:31:28,995 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 167.8MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:31:28,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.98ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 81.3MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:31:28,996 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.59ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 79.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:31:28,996 INFO L158 Benchmark]: Boogie Preprocessor took 78.06ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:31:28,997 INFO L158 Benchmark]: RCFGBuilder took 458.47ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 64.3MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:31:28,997 INFO L158 Benchmark]: TraceAbstraction took 902911.72ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 63.6MB in the beginning and 258.0MB in the end (delta: -194.4MB). Peak memory consumption was 124.2MB. Max. memory is 16.1GB. [2024-11-27 20:31:28,999 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.47ms. Allocated memory is still 167.8MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.98ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 81.3MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.59ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 79.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 78.06ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 458.47ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 64.3MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 902911.72ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 63.6MB in the beginning and 258.0MB in the end (delta: -194.4MB). Peak memory consumption was 124.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_6.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16f616cbb154d125e085ac05764879da22cdfe3693ed1f1a6c28186441fe892d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:31:32,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:31:32,173 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-27 20:31:32,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:31:32,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:31:32,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:31:32,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:31:32,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:31:32,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:31:32,239 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:31:32,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:31:32,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:31:32,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:31:32,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:31:32,240 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:31:32,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:31:32,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:31:32,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:31:32,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:31:32,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:31:32,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:31:32,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:31:32,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:31:32,242 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:31:32,242 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 20:31:32,242 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 20:31:32,242 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:31:32,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:31:32,243 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:31:32,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:31:32,243 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:31:32,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:31:32,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:31:32,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:31:32,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:31:32,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:31:32,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:31:32,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:31:32,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:31:32,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:31:32,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:31:32,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:31:32,246 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:31:32,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:31:32,246 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 20:31:32,246 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 20:31:32,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:31:32,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:31:32,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:31:32,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:31:32,247 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB 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 -> Automizer 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 -> 16f616cbb154d125e085ac05764879da22cdfe3693ed1f1a6c28186441fe892d [2024-11-27 20:31:32,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:31:32,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:31:32,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:31:32,657 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:31:32,659 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:31:32,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/combinations/gcd_2+newton_2_6.i [2024-11-27 20:31:36,079 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/data/6d1d441ab/faa4b5f3e37b464cb0339a037ff8fe2f/FLAG450e17d4d [2024-11-27 20:31:36,468 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:31:36,469 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i [2024-11-27 20:31:36,495 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/data/6d1d441ab/faa4b5f3e37b464cb0339a037ff8fe2f/FLAG450e17d4d [2024-11-27 20:31:36,535 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/data/6d1d441ab/faa4b5f3e37b464cb0339a037ff8fe2f [2024-11-27 20:31:36,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:31:36,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:31:36,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:31:36,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:31:36,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:31:36,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:31:36" (1/1) ... [2024-11-27 20:31:36,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15157200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:36, skipping insertion in model container [2024-11-27 20:31:36,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:31:36" (1/1) ... [2024-11-27 20:31:36,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:31:36,832 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_7eefc68a-5b95-4f03-8ade-dbba5f88b825/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[1226,1239] [2024-11-27 20:31:36,894 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_7eefc68a-5b95-4f03-8ade-dbba5f88b825/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[2841,2854] [2024-11-27 20:31:36,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:31:36,913 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:31:36,931 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_7eefc68a-5b95-4f03-8ade-dbba5f88b825/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[1226,1239] [2024-11-27 20:31:36,947 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_7eefc68a-5b95-4f03-8ade-dbba5f88b825/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[2841,2854] [2024-11-27 20:31:36,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:31:36,972 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:31:36,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:36 WrapperNode [2024-11-27 20:31:36,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:31:36,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:31:36,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:31:36,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:31:36,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:36" (1/1) ... [2024-11-27 20:31:37,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:36" (1/1) ... [2024-11-27 20:31:37,049 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2024-11-27 20:31:37,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:31:37,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:31:37,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:31:37,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:31:37,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:36" (1/1) ... [2024-11-27 20:31:37,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:36" (1/1) ... [2024-11-27 20:31:37,074 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:36" (1/1) ... [2024-11-27 20:31:37,100 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-27 20:31:37,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:36" (1/1) ... [2024-11-27 20:31:37,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:36" (1/1) ... [2024-11-27 20:31:37,115 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:36" (1/1) ... [2024-11-27 20:31:37,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:36" (1/1) ... [2024-11-27 20:31:37,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:36" (1/1) ... [2024-11-27 20:31:37,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:36" (1/1) ... [2024-11-27 20:31:37,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:36" (1/1) ... [2024-11-27 20:31:37,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:31:37,143 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:31:37,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:31:37,143 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:31:37,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:36" (1/1) ... [2024-11-27 20:31:37,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:31:37,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:31:37,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:31:37,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eefc68a-5b95-4f03-8ade-dbba5f88b825/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:31:37,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:31:37,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 20:31:37,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-27 20:31:37,248 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-27 20:31:37,248 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-27 20:31:37,249 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-27 20:31:37,249 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-27 20:31:37,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:31:37,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:31:37,340 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:31:37,343 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation